RETRIEVING THE PAPER:
TITLE:
Computational experience with an interior point cutting plane algorithm
AUTHOR:
John E. Mitchell
Department of Mathematical Sciences
Rensselaer Polytechnic Institute
Troy, NY 12180
mitchj@rpi.edu
PUBLICATION DETAILS:
SIAM
Journal on Optimization, Volume 10(4), pages 1212-1227, 2000.
ABSTRACT:
There has been a great deal of success in the last
twenty years with the use of cutting plane algorithms
to solve specialized integer programming problems.
Generally, these algorithms work by solving a sequence
of linear programming relaxations of the integer
programming problem, and they use the simplex
algorithm to solve the relaxations. In this paper,
we describe experiments using a predictor-corrector
interior point method to solve the relaxations. For
some problems, the interior point code requires
considerably less time than a simplex based cutting
plane algorithm.
KEYWORDS:
Interior point methods, integer programming, cutting planes,
linear ordering, Ising spin glasses.
RETRIEVING THE PAPER:
THE PROBLEMS:
The generators for the problems described in the paper can be obtained
from here.
Return to my list of papers.