Abstract
Over the last 25 years, the combination of faster computers, more reliable data and improved algorithms has resulted in the near-routine solution of many integer programs of practical interest. Integer programming models are used in a wide variety of applications, including scheduling, resource assignment, planning, supply chain design, auction design, and many, many others. In this tutorial, we outline some of the major themes involved in creating and solving integer programming models.
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
Similar content being viewed by others
References
Applegate DL, Bixby RE, Chvatal V, Cook WJ (2011) The traveling salesman problem: a computational study. Princeton University Press
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for huge integer programs. Oper Res 46:316
Bixby RE, Fenelon M, Gu Z, Rothberg E, Wunderling R (1999) MIP: theory and practice—closing the gap. In: Proceedings of the 19th IFIP TC7 conference on system modelling, Cambridge. Kluwer, Dordrecht, pp 19–50
Common Optimization INterface for Operations Research (COIN-OR) (2004) http://www.coin-or.org
Cordier C, Marchand H, Laundy R, Wolsey LA (1999) bc-opt: a branch-and-cut code for mixed integer programs. Math Program 86:335
Crowder H, Johnson EL, Padberg MW (1983) Solving large scale zero-one linear programming problems. Oper Res 31:803–834
Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64(5):275–278
Gueret C, Prins C, Sevaux M (2002) Applications of optimization with Xpress-MP (trans: Heipcke S). Dash Optimization, Blisworth
Hillier FS, Lieberman GJ (2009) Introduction to operations research, 9th edn. McGraw-Hill, New York
Jünger M, Reinelt G, Thienel S (1995) Practical problem solving with cutting plane algorithms in combinatorial optimization. DIMACS series in discrete mathematics and theoretical computer science. AMS, Providence, p 111
Jünger M, Liebling T, Naddef D, Nemhauser G, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L (2010) 40 years of integer programming 1958–2008. Springer, Heidelberg
Land AH, Doig AG (1960) An automatic method for solving discrete programming problems. Econometrica 28:83–97
Nemhauser GL, Wolsey LA (1998) Integer and combinatorial optimization. Wiley, New York
Ralphs TK, Ladanyi L (1999) SYMPHONY: a parallel framework for branch and cut. White paper, Rice University
Schrijver A (1998) Theory of linear and integer programming. Wiley, New York
Taha HA (2010) Operations research: an introduction, 9th edn. Prentice-Hall, New York
Williams HP (1999) Model building in mathematical programming. Wiley, New York
Winston W (2003) Operations research: applications and algorithms, 4th edn. Thomson, New York
Wolsey LA (1998) Integer programming. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bosch, R., Trick, M. (2014). Integer Programming. In: Burke, E., Kendall, G. (eds) Search Methodologies. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6940-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6940-7_3
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-6939-1
Online ISBN: 978-1-4614-6940-7
eBook Packages: Business and EconomicsBusiness and Management (R0)