Live briefing
Everything about Integer programming
Mathematical optimization problem restricted to integers
An integer programming, also known as integer optimization, problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints are linear. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Integer programmingA 5-minute orientation
- Skim a recent paper: Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming ApproachInfluential work since 2022
- Pick up a classic book: Integer and combinatorial optimizationThe most-reprinted book on the subject
- Read the landmark paper: Future paths for integer programming and links to artificial intelligenceCited 3,283 times
- Go sideways: Branch and cutA closely related topic
- Go sideways: Linear programming relaxationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Future paths for integer programming and links to artificial intelligence
Integer Programming Formulation of Traveling Salesman Problems
Branch-and-Price: Column Generation for Solving Huge Integer Programs
The Lagrangian Relaxation Method for Solving Integer Programming Problems
🆕 Influential since 2022
Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming Approach
Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems
Optimal Qubit Assignment and Routing via Integer Programming
A Biobjective Perspective for Mixed-Integer Programming
Computing equilibria for integer programming games
📚 Books worth reading
Integer and combinatorial optimizationGeorge L. Nemhauser · 1988
Integer programmingLaurence A. Wolsey · 1998
Linear and integer programmingGerard Sierksma · 1996
Integer programmingJohn K. Karlof · 2005
Linear and Integer Programming Made EasyT. C. Hu, Andrew B. Kahng · 2015
Dual-Feasible Functions for Integer Programming and Combinatorial OptimizationCláudio Alves, Francois Clautiaux · 2016
Multiobjective Linear and Integer ProgrammingCarlos Henggeler Antunes, Maria Joao Alves · 2016
Integer programmingHamdy A. Taha · 1975
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Branch and cut Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some…
- Linear programming relaxation In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Relaxation (approximation) In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby…
- Configuration linear program The configuration linear program (configuration-LP) is a linear programming technique used for solving combinatorial optimization problems. It was introduced…
- Lagrangian relaxation In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization…
- Graver basis In applied mathematics, Graver bases enable iterative solutions of linear and various nonlinear integer programming problems in polynomial time. They were…
- Mathematical optimization Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criteria…