Integer programming

Known as: Integer constraint, Integer linear optimization, Integer Programming Problem 
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be… (More)
Wikipedia

Related topics

Related topics

50 relations
APMonitorAlgorithmAnt colony optimization algorithmsArc routing
(More)

Broader (2)

Combinatorial optimizationOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Parametric integer programming
— When anaiysing computer programs (especially numerical programs in which arrays are used extensively), one is often confronted… (More)
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Mixed Integer Programming
The IMA Special Workshop on Mixed-Integer Programming was held in Minneapolis on July 25–29, 2005, at the Institute for… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation… (More)
  • figure 2
  • figure 1
  • table I
  • table II
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Minkowski's Convex Body Theorem and Integer Programming
Supported by NSF grant ECS-8418392 I n t r o d u c t i o n The Integer Programming (feasibility) Problem is the problem of… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Future paths for integer programming and links to artificial intelligence
Integer programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Integer Programming with a Fixed Number of Variables
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
On the complexity of integer programming
A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
This paper proposes a class of surrogate constraint heuristics for obtaining approximate, 'near optimal solutions to integer… (More)
  • figure I
  • table I
Is this relevant?
Highly Cited
1960
Highly Cited
1960
Integer Programming Formulation of Traveling Salesman Problems
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems… (More)
Is this relevant?