Computational Experience with an Interior Point Cutting Plane Algorithm

Authors:
John E. Mitchell
Affiliations:
-
Venue:
SIAM Journal on Optimization
Year:
1999

Citing 0
Cited 5

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

Computational Optimization and Applications
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension

Computational Optimization and Applications
An interior point cutting plane heuristic for mixed integer programming

Computers and Operations Research
On Interior-Point Warmstarts for Linear and Combinatorial Optimization

SIAM Journal on Optimization
Using the primal-dual interior point algorithm within the branch-price-and-cut method

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

There has been a great deal of success in the last 20 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.