Interior point methods for combinatorial optimization
Download the paper,
postscript or pdf
(95 pages).
Authors:
John E. Mitchell
Department of Mathematical Sciences,
Rensselaer Polytechnic Institute,
Troy, NY 12180 USA.
mitchj@rpi.edu
Panos Pardalos
Center for Applied Optimization, ISE Department,
University of Florida,
Gainesville, FL 32611 USA.
pardalos@ufl.edu
Mauricio G. C. Resende
Information Sciences Research,
AT&T Labs Research,
Florham Park, NJ 07932 USA.
mgcr@research.att.com
November 1997
Table of Contents:
- Introduction
- Combinatorial optimization
- Solution techniques
- Interior point methods for linear and network programming
- Branch and bound methods
- Branch and cut methods
- Nonconvex potential function minimization
- A lower bounding technique
- Semidefinite programming relaxations
- Concluding remarks
- References
To appear in the
Handbook
of Combinatorial Optimization,
edited by D.-Z. Du and
Panos Pardalos,
Kluwer Academic Publishers, 1998.
Download the paper,
postscript or pdf
(95 pages).
Return to my list of papers.