Abstract
The importance of integer programming stems from the fact that it can be used to model a vast array of problems arising from the most disparate areas, ranging from practical ones (scheduling, allocation of resources, etc.) to questions in set theory, graph theory, or number theory. We present here a selection of integer programming models, several of which will be further investigated later in this book.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
T. Achterberg, Constraint Integer Programming. Ph.D. thesis, ZIB, Berlin, 2007
D. Applegate, R.E. Bixby, V. Chvátal, W.J. Cook, The Traveling Salesman Problem. A Computational Study (Princeton University Press, Princeton, 2006)
A. Atamtürk, G.L. Nemhauser, M.W.P. Savelsbergh, Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121, 40–55 (2000)
J.A. Bondy, U.S.R. Murty, Graph Theory (Springer, New York, 2008)
W.J. Cook, In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (Princeton University Press, Princeton, 2012)
G. Cornuéjols, R. Tütüncü, Optimization Methods in Finance (Cambridge University Press, Cambridge, 2007)
G. Dantzig. R. Fulkerson, S. Johnson, Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393–410 (1954)
R. Dechter, Constraint Processing (Morgan Kaufmann, San Francisco, 2003)
J. Edmonds, D.R. Fulkerson, Bottleneck extrema. J. Combin. Theory 8, 299–306 (1970)
R. Fortet, Applications de l’algèbre de Boole en recherche opérationnelle. Revue Française de Recherche Opérationnelle 4, 17–26 (1960)
L.R. Ford Jr., D.R. Fulkerson, Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)
D.R Fulkerson, Blocking polyhedra, B Harris (Ed.), Graph Theory and Its Applications, Academic Press, New York 93–112 (1970)
D.R. Fulkerson, G.L. Nemhauser, L.E. Trotter, Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples. Math. Program. Study 2, 72–81 (1974)
P.C. Gilmore, Families of sets with faithful graph representation. IBM Research Note N.C., vol. 184 (Thomas J. Watson Research Center, Yorktown Heights, 1962)
P.C. Gilmore, R.E. Gomory, A linear programming approach to the cutting-stock problem. Oper. Res. 9, 849–859 (1961)
M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115–1145 (1995)
C. Guéret, C. Prins, M. Servaux, Applications of Optimization with Xpress (Dash Optimization Ltd., London, 2002)
J. Hooker, Integrated Methods for Optimization. International Series in Operations Research and Management Science (Springer, New York, 2010)
V. Kaibel, S. Weltge, Lower bounds on the sizes of integer programs without additional variables. arXiv:1311.3255 (2013)
H. Kellerer, U. Pferschy, D. Pisinger, Knapsack Problems (Springer, Berlin, 2004)
E. L. Lawler, Covering problems: duality relations and a method of solution. SIAM J. Appl. Math. 14, 1115–1132 (1966)
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)
A. Lehman, On the width-length inequality. Math. Program. 17, 403–417 (1979)
S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, Chichester, 1990)
C.E. Miller, A.W. Tucker, R.A. Zemlin, Integer programming formulation of traveling salesman problems. J. ACM 7, 326–329 (1960)
J. Ostrowski, J.T. Linderoth, F. Rossi, S. Smriglio, Solving large Steiner triple covering problems. Oper. Res. Lett. 39, 127–131 (2011)
Y. Pochet, L.A. Wolsey, Production Planning by Mixed-Integer Programming. Springer Series in Operations Research and Financial Engineering (Springer, New York, 2006)
M. Queyranne, A.S. Schulz, Polyhedral approaches to machine scheduling. Preprint (1994)
P. Toth, D. Vigo, The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, 2001)
L.A. Wolsey, Integer Programming (Wiley, New York, 1999)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Conforti, M., Cornuéjols, G., Zambelli, G. (2014). Integer Programming Models. In: Integer Programming. Graduate Texts in Mathematics, vol 271. Springer, Cham. https://doi.org/10.1007/978-3-319-11008-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-11008-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11007-3
Online ISBN: 978-3-319-11008-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)