268
A. Riccardi et al.
80. B. Fornberg, A Practical Guide to Pseudospectral Methods (Cambridge University Press,
Cambridge, 1998)
81. M. Jnger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, G.
Rinaldi, L.A. Wolsey, 50 Years of Integer Programming 1958–2008: From the Early Years
to the State-of-the-Art (Springer, Berlin, 2009)
82. A. Kaufmann, A. Henry-Laborde` re, Integer and Mixed Programming: Theory and Applications, vol. 137 (Elsevier, Amsterdam, 1977)
83. M. Josefsson, M. Mützell, Max Flow Algorithms Ford-Fulkerson, Edmond-Karp, GoldbergTarjan Comparison in regards to practical running time on different types of randomized flow
networks. KTH Computer Science and Communication, Stockholm (2015)
84. P. Belotti, C. Kirches, S. Leyffer, J. Linderoth, J. Luedtke, A. Mahajan, Mixed-integer
nonlinear optimization. Acta Numer. 22, 1–131 (2013)
85. K. Murty, Linear and Combinatorial Programming (John Wiley & Sons, Inc., New York,
1976)
86. J. Abadie, Integer and Nonlinear Programming (North-Holland Pub. Co., Amsterdam, 1970)
87. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003)
88. N. Christofides, Worst-case analysis of a New Heuristic for the travelling salesman problem.
GSIA report 388, Carnegie-Mellon University (1976)
89. S. Lin, B.W. Kernighan, An effective heuristic algorithm for the travelling-salesman problem.
Oper. Res. 21, 498–516 (1973)
90. E. Balas, C.H. Martin, Pivot-and-complement: a heuristic for 0-1 programming. Manag. Sci.
26(1), 86–96 (1980)
91. E. Balas, C.H. Martin, Pivot-and-Shift: A Heuristic for Mixed Integer Programming (GSIA,
Carnegie Mellon University, Pittsburgh, 1986)
92. M. Fischetti, A. Lodi, Local branching. Math. Program. 98(1), 23–47 (2003)
93. F. Glover, A. Lkketangen, D.L. Woodruff, Scatter search to generate diverse MIP solutions,
in OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer
Science and Operations Research (2000)
94. E. Balas, S. Ceria, M. Dawande, F. Margot, G. Pataki, Octane: a New Heuristic for pure 0-1
programs. Oper. Res. 49(2), 207–225 (2001)
95. E. Danna, E. Rothberg, C.L. Pape, Exploring relaxation induced neighborhoods to improve
MIP solutions. Math. Program. 102, 71–90 (2005)
96. G.L. Nemhauser, A.G.H. Rinnooy Kan, M.J. Todd, Optimization, vol. 1 (North Holland,
Amsterdam, 1989)
97. D. Bertsekas, Network Optimization: Continuous and Discrete Models (Athena Scientific,
Belmont, 1998)
98. N. Shah, S. Kumar, F. Bastani, I.L. Yen, A space-time network optimization model for traffic
coordination and its evaluation, in 2008 IEEE International Conference on Sensor Networks,
Ubiquitous, and Trustworthy Computing (SUTC 2008), Taichung (2008), pp. 177–184
99. South Staffs Water, Network Optimisation and Energy Management Business Strategy (2013)
100. C. Sun, L. Cheng, T. Xu, Range of user-equilibrium route flow with applications. Procedia.
Soc. Behav. Sci. 138, 86–96 (2014)
101. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, Hoboken,
1999)
102. K. G. Murty, Network Programming (Prentice Hall, Upper Saddle River, 1992)
A. Riccardi et al.
80. B. Fornberg, A Practical Guide to Pseudospectral Methods (Cambridge University Press,
Cambridge, 1998)
81. M. Jnger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, G.
Rinaldi, L.A. Wolsey, 50 Years of Integer Programming 1958–2008: From the Early Years
to the State-of-the-Art (Springer, Berlin, 2009)
82. A. Kaufmann, A. Henry-Laborde` re, Integer and Mixed Programming: Theory and Applications, vol. 137 (Elsevier, Amsterdam, 1977)
83. M. Josefsson, M. Mützell, Max Flow Algorithms Ford-Fulkerson, Edmond-Karp, GoldbergTarjan Comparison in regards to practical running time on different types of randomized flow
networks. KTH Computer Science and Communication, Stockholm (2015)
84. P. Belotti, C. Kirches, S. Leyffer, J. Linderoth, J. Luedtke, A. Mahajan, Mixed-integer
nonlinear optimization. Acta Numer. 22, 1–131 (2013)
85. K. Murty, Linear and Combinatorial Programming (John Wiley & Sons, Inc., New York,
1976)
86. J. Abadie, Integer and Nonlinear Programming (North-Holland Pub. Co., Amsterdam, 1970)
87. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003)
88. N. Christofides, Worst-case analysis of a New Heuristic for the travelling salesman problem.
GSIA report 388, Carnegie-Mellon University (1976)
89. S. Lin, B.W. Kernighan, An effective heuristic algorithm for the travelling-salesman problem.
Oper. Res. 21, 498–516 (1973)
90. E. Balas, C.H. Martin, Pivot-and-complement: a heuristic for 0-1 programming. Manag. Sci.
26(1), 86–96 (1980)
91. E. Balas, C.H. Martin, Pivot-and-Shift: A Heuristic for Mixed Integer Programming (GSIA,
Carnegie Mellon University, Pittsburgh, 1986)
92. M. Fischetti, A. Lodi, Local branching. Math. Program. 98(1), 23–47 (2003)
93. F. Glover, A. Lkketangen, D.L. Woodruff, Scatter search to generate diverse MIP solutions,
in OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer
Science and Operations Research (2000)
94. E. Balas, S. Ceria, M. Dawande, F. Margot, G. Pataki, Octane: a New Heuristic for pure 0-1
programs. Oper. Res. 49(2), 207–225 (2001)
95. E. Danna, E. Rothberg, C.L. Pape, Exploring relaxation induced neighborhoods to improve
MIP solutions. Math. Program. 102, 71–90 (2005)
96. G.L. Nemhauser, A.G.H. Rinnooy Kan, M.J. Todd, Optimization, vol. 1 (North Holland,
Amsterdam, 1989)
97. D. Bertsekas, Network Optimization: Continuous and Discrete Models (Athena Scientific,
Belmont, 1998)
98. N. Shah, S. Kumar, F. Bastani, I.L. Yen, A space-time network optimization model for traffic
coordination and its evaluation, in 2008 IEEE International Conference on Sensor Networks,
Ubiquitous, and Trustworthy Computing (SUTC 2008), Taichung (2008), pp. 177–184
99. South Staffs Water, Network Optimisation and Energy Management Business Strategy (2013)
100. C. Sun, L. Cheng, T. Xu, Range of user-equilibrium route flow with applications. Procedia.
Soc. Behav. Sci. 138, 86–96 (2014)
101. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, Hoboken,
1999)
102. K. G. Murty, Network Programming (Prentice Hall, Upper Saddle River, 1992)