Papers on discrete optimization

MIP/IP Bibliography for Survey by Harvey J. Greenberg (gzip)

Kipp Martin. A Modeling System for Mixed Integer Linear Programming Using XML Technologies

Marco Dorigo, Gianni Di Caro, Luca M. Gambardella. Ant Algorithms for Discrete Optimization (1999) Proceedings of the Congress on Evolutionary Computation

M.W.P. Savelsbergh. (2001). Branch-and-Price: Integer Programming with Column Generation. Encyclopedia of Optimization (C. Floudas, P. Pardalos, Eds.).

Discrete Optimization Notes

Robert Brayton et al. Negative Thinking for Exact Discrete Optimization

G.L. Nemhauser, M.W.P. Savelsbergh, G.S. Sigismondi (1994). MINTO, a Mixed INTeger Optimizer. Oper. Res. Letters 15, 47-58.

M.W.P. Savelsbergh, G.L. Nemhauser (1995). A MINTO short course. Report COC-95-xx, Georgia Institute of Technology.

Summary of Complexity Analysis for Discrete Optimization

M.W.P. Savelsbergh (1994). Preprocessing and Probing for Mixed Integer Programming Problems. ORSA J. on Computing 6, 445-454.

Integration of Constraint Programming and Integer Programming for Combinatorial Optimization (2000) (PhD thesis by Greger Ottosson)

Papers on mixed-integer programming (MILP and MINLP), General Disjunctive Programming (GDP), global optimization and multiperiod optimization (Ignacio Grossman’s group).

A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh (1996). A Combined Lagrangian, Linear Programming, and Implication Heuristic for Large-scale Set Partitioning Problem. Journal of Heuristics 1, 247-259.

A. Atamturk, E. L. Johnson, J. T. Linderoth and M. W. P. Savelsbergh, "A Relational Modeling System for Linear and Integer Programming," Operations Research, 48 (2000), pp.846-857.

Alper Atamturk and M.W.P. Savelsbergh (2004). Integer-Programming Software Systems. To appear in Annals of Operations Research.

A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh (2000). Conflict Graphs in Integer Programming. European Journal of Operations Research 121, 40-55.

Q. Chen, M. Ferris, and J. T. Linderoth, "FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver," Annals of Operations Research 103 (2001), pp. 17-32.

J. T. Linderoth and M. W. P. Savelsbergh, "A Computational Study of Branch and Bound Search Strategies for Mixed Integer Programming," INFORMS Journal on Computing, 11 (1999) pp. 173-187.

W. Glankwamdee and J. T. Linderoth, ``MW: A Software Framework for Combinatorial Optimization on Computational Grids,'' E. Talbi, (ed). Parallel Combinatorial Optimization, John Wiley & Sons, forthcoming, 2006.

J. T. Linderoth and T. K. Ralphs, ``Noncommercial Software for Mixed-Integer Linear Programming'', J. Karlof (ed). Integer Programming: Theory and Practice, CRC Press Operations Research Series, 2005, 253-303.

J. T. Linderoth, Topics in Parallel Integer Optimization, PhD Thesis, Georgia Institute of Technology, 1998.

M. Laurent, F. Rendl. Semidefinite programming and integer programming (PS file)

S.Mehrotra, Zh.Li. On generalized branching methods for mixed integer programming

R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh (1998). An Updated Mixed Integer Programming Library: MIPLIB 3.0. Optima 54, 12-15.

D.P. Clements, J.M. Crawford, D.E. Joslin, G.L. Nemhauser, M.E. Puttlitz, M.W.P. Savelsbergh (1997). Heuristic Optimization: A Hybrid AI/OR approach. Proceedings of CP97: Constraint-directed Scheduling.

S. Leyffer. Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming

P. Bonami, L. Biegler et al.. An algorithmic framework for convex mixed integer nonlinear programs

R. Fourer. OR Counterparts to AI Planning

J.-P. Goux, Sven Leyffer. Solving large MINLPs on computational grids

A. Atamturk, M. Savelsbergh. Integer-Programming Software Systems

B.Borchers and J. E. Mitchell An improved branch and bound algorithm for mixed integer nonlinear programs.

C. Gervet. Large Combinatorial Optimization Problems: a Methodology for Hybrid Models and Solutions (1998)


A.Bockmayr, T. Kasper. A Unifying Framework for Integer and Finite Domain Constraint Programming (1997)

Tao Wang. Global Optimization For Constrained Nonlinear Programming (PhD thesis, 2001)


Yi Shang. Global Search Methods For Solving Nonlinear Optimization Problems (PhD thesis, 1997)


Zhe Wu. The Theory And Applications Of Discrete Constrained Optimization Using Lagrange Multipliers (PhD thesis, 2000)


E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh (2000). Progress in Linear Programming Based Branch-and-Bound Algorithms: An Exposition. INFORMS Journal on Computing 12.