Computational Experience with an Interior Point Cutting Plane Algorithm

DOI10.1137/S1052623497324242zbMath0999.90050OpenAlexW1989947834MaRDI QIDQ4509760

John E. Mitchell

Publication date: 19 October 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497324242

zbMATH Keywords

integer programminginterior point methodscutting planeslinear orderingmax cutIsing spin glasses

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interior-point methods (90C51)

Related Items (21)

An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison ⋮ IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ Constrained integer fractional programming problem with box constraints ⋮ Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ A note on the primal-dual column generation method for combinatorial optimization ⋮ Cuts for mixed 0-1 conic programming ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

This page was built for publication: Computational Experience with an Interior Point Cutting Plane Algorithm