Fifty-Plus Years of Combinatorial Integer Programming

@inproceedings{Cook2010FiftyPlusYO,
  title={Fifty-Plus Years of Combinatorial Integer Programming},
  author={W. Cook},
  booktitle={50 Years of Integer Programming},
  year={2010}
}
  • W. Cook
  • Published in
    50 Years of Integer…
    2010
  • Computer Science
Throughout the history of integer programming, the field has been guided by research into solution approaches to combinatorial problems. We discuss some of the highlights and defining moments of this area. 
21 Citations
Mixed Integer Linear Programming Formulation Techniques
  • 157
  • PDF
Gap inequalities for non-convex mixed-integer quadratic programs
  • 15
  • PDF
New approaches to integer programming
  • PDF
Complexity results for the gap inequalities for the max-cut problem
  • 5
  • PDF
Reformulations and Relaxations
  • 1
...
1
2
3
...

References

SHOWING 1-10 OF 233 REFERENCES
COMBINATORIAL PROCESSES AND DYNAMIC PROGRAMMING
  • 65
Mixed-integer programming—1968 and thereafter
  • 2
George Dantzig's contributions to integer programming
  • 13
  • PDF
Matching: A Well-Solved Class of Integer Linear Programs
  • 223
  • PDF
Cutting Planes in Combinatorics
  • V. Chvátal
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 1985
  • 15
Matroids and the greedy algorithm
  • J. Edmonds
  • Mathematics, Computer Science
  • Math. Program.
  • 1971
  • 740
  • PDF
Discrete-Variable Extremum Problems
  • 802
Combinatorics, complexity, and randomness
  • R. Karp
  • Mathematics, Computer Science
  • CACM
  • 1986
  • 109
  • PDF
On Linear Characterizations of Combinatorial Optimization Problems
  • 84
...
1
2
3
4
5
...