Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

116

Voted

SIAMJO
2000

favoriteEmaildiscussreport

116views more SIAMJO 2000»

Computational Experience with an Interior Point Cutting Plane Algorithm

15 years 26 days ago

Computational Experience with an Interior Point Cutting Plane Algorithm

Download www.rpi.edu

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.

John E. Mitchell

Real-time Traffic

Algorithm | Integer Programming Problem | Linear Programming Relaxations | SIAMJO 2000 |

claim paper

Related Content

» Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

» Phenotype phase plane analysis using interior point methods

» Cutting plane algorithms for 01 programming based on cardinality cuts

» A Specialized InteriorPoint Algorithm for Multicommodity Network Flows

» Resolving Loads with Positive Interior Stresses

» Geodesic hamsandwich cuts

» A Randomized Cutting Plane Method with Probabilistic Geometric Convergence

» A uniformity criterion and algorithm for data clustering

» SegmentBased Stereo Matching Using Graph Cuts

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMJO
Authors	John E. Mitchell

Comments (0)