Models and algorithms for maximum flow problems having semicontinuous path flow constraints

References

• Aggarwal, C.C. and Orlin, J.B. (2002) On multiroute maximum flows in networks. Networks, 39(1), 43–52.
   Web of Science ®Google Scholar
• Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms, and Applications, Prentice Hall: Upper Saddle River, NJ.
   Google Scholar
• Angulo, G., Ahmed, S. and Dey, S. (2014) Semi-continuous network flow problems. Mathematical Programming, 145(1–2), 565–599.
   Web of Science ®Google Scholar
• Barnhart, C., Hane, C.A., Johnson, E.L. and Sigismondi, G. (1995) A column generation and partitioning approach for multi-commodity flow problems. Telecommunication Systems, 3(3), 239–258.
   Web of Science ®Google Scholar
• Beale, E.M. (1979) Branch and bound methods for mathematical programming systems. Annals of Discrete Mathematics, 5, 201–219.
   Google Scholar
• Beale, E.M. (1980) Branch-and-bound methods for numerical optimization, in Proceedings of the conference on Computational Statistics, Physica Verlag: Edinburgh, Scotland, pp. 11–20.
   Google Scholar
• Beale, E.M. (1985) Integer programming. in K. Schittkowski, (eds), Computational Mathematical Programming, vol. 15, Springer: Berlin, Heidelberg, pp. 1–24.
   Google Scholar
• Bienstock, D. (1996) Computational study of a family of mixed-integer quadratic programming problems. Mathematical Programming, 74, 121–140.
   Web of Science ®Google Scholar
• Bodlaender, H.L., Tan, R.B., van Dijk, T.C. and van Leeuwen, J. (2008) Integer maximum flow in wireless sensor networks with energy constraint, in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Springer: Gothenburg, Sweden, pp. 102–113.
   Google Scholar
• De Farias, I.R., Johnson, E.L. and Nemhauser, G.L. (2001) Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. The Knowledge Engineering Review, 16(1), 25–39.
   Web of Science ®Google Scholar
• Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1995) Time constrained routing and scheduling, in G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, (eds), Handbooks in Operations Research and Management Science, vol. 8, Elsevier: Amsterdam, The Netherlands, pp. 35–139.
   Google Scholar
• Dijkstra, E.W. (1959) A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
   Web of Science ®Google Scholar
• Ford, L.R. and Fulkerson, D.R. (1956) Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.
   Google Scholar
• Garey, M.R. and Johnson, D.S. (1975) Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4), 397–411.
   Google Scholar
• Gerald, G., Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, T., … Witzig, J. (2016) The SCIP optimization suite 3.2, Tech. Rep. 15-60, ZIB: Berlin, Germany.
   Google Scholar
• Haouari, M., Mrad, H. and Sherali, H.D. (2007) Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optimization Letters, 1(4), 341–354.
   Web of Science ®Google Scholar
• Kallrath, J. (2000) Mixed integer optimization in the chemical process industry: Experience, potential, and future perspectives. Chemical Engineering Research and Design, 78(6), 809–822.
   Web of Science ®Google Scholar
• Kallrath, J. (2002) Combined strategic and operational planning–an MILP success story in the chemical industry. OR Spectrum, 24(3), 315–341.
   Web of Science ®Google Scholar
• McCormick, G.P. (1983) Nonlinear Programming: Theory, Algorithms, and Applications. John Wiley & Sons: New York, NY.
   Google Scholar
• Miller, C.E., Tucker, A.W. and Zemlin, R.A. (1960) Integer programming formulation of traveling salesman problems. Journal of the Association for Computing Machinery, 7(4), 326–329.
   Web of Science ®Google Scholar
• Monsell, S. (2003) Task switching. Trends in Cognitive Sciences, 7(3), 134–140.
   PubMed Web of Science ®Google Scholar
• Ordóñez, F. and Krishnamachari, B. (2004) Optimal information extraction in energy-limited wireless sensor networks. IEEE Journal on Selected Areas in Communications, 22(6), 1121–1129.
   Web of Science ®Google Scholar
• Perold, A.F. (1984) Large-scale portfolio optimization. Management Science, 30, 1143–1160.
   Web of Science ®Google Scholar
• Punnen, A.P. (1991) A linear time algorithm for the maximum capacity path problem. European Journal of Operational Research, 53(3), 402–404.
   Web of Science ®Google Scholar
• Sherali, H.D. and Smith, J.C. (2001) Improving discrete model representations via symmetry considerations. Management Science, 47(10), 1396–1407.
   Web of Science ®Google Scholar
• Tao, S., Xu, K., Xu, Y., Fei, T., Gao, L., Guerin, R., Kurose, J., Towsley, D. and Zhang, Z. (2004) Exploring the performance benefits of end-to-end path switching, in Proceedings of the 12th IEEE International Conference on Network Protocols, IEEE: Berlin, Germany, pp. 304–315.
   Google Scholar
• Timpe, C.H. and Kallrath, J. (2000) Optimal planning in large multi-site production networks. European Journal of Operational Research, 126(2), 422–435.
   Web of Science ®Google Scholar
• Wollmer, R.D. (1968) Maximizing flow through a network with node and arc capacities. Transportation Science, 2(3), 213–232.
   Google Scholar