Abstract
This chapter provides an introduction to Integer Linear Programming (ILP). After reviewing the effective modeling of a problem via ILP, the chapter describes the two main solving procedures for integer programs, i.e., branch-and-bound and cutting planes. The theory of totally unimodular matrices is introduced to account for problems whose models have naturally integer solutions. State-of-the-art solvers for mixed-integer linear programs are described at the conclusion.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Lancia, G., Serafini, P. (2018). Integer Linear Programming. In: Compact Extended Linear Programming Models. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-319-63976-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-63976-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63975-8
Online ISBN: 978-3-319-63976-5
eBook Packages: Business and ManagementBusiness and Management (R0)