Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
APMonitorAlgorithmAnt colony optimization algorithmsArc routing

Broader (2)

Combinatorial optimizationOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
Integer Programming
The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning… 
Review
2010
Review
2010
Production Planning by Mixed Integer Programming
This textbook provides a comprehensive modeling, reformulation and optimization approach for solving production planning and… 
Review
2004
Review
2004
The Lagrangian Relaxation Method for Solving Integer Programming Problems
  • M. Fisher
  • Management Sciences
  • 2004
  • Corpus ID: 1227951
(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute… 
Highly Cited
1987
Highly Cited
1987
Minkowski's Convex Body Theorem and Integer Programming
  • R. Kannan
  • Mathematics of Operations Research
  • 1987
  • Corpus ID: 495512
The paper presents an algorithm for solving Integer Programming problems whose running time depends on the number n of variables… 
Highly Cited
1986
Highly Cited
1986
Theory of linear and integer programming
  • A. Schrijver
  • Wiley-Interscience series in discrete mathematics…
  • 1986
  • Corpus ID: 29180149
Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND… 
Highly Cited
1983
Highly Cited
1983
Integer Programming with a Fixed Number of Variables
  • H. Lenstra
  • Mathematics of Operations Research
  • 1983
  • Corpus ID: 7868492
It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof… 
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… 
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… 
Highly Cited
1975
Highly Cited
1975
IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS
A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer… 
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)