Computational Experience with an Interior Point Cutting Plane Algorithm

DOI10.1137/S1052623497324242MaRDI QIDQ4509760zbMATH OpenOpenAlexFDO

Authors 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

cutting planesinteger programminginterior point methodsIsing spin glasseslinear orderingmax cut

Mathematics Subject Classification ID

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

Recommendations

• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• The mixed cutting plane algorithm for all-integer programming
• scientific article; zbMATH DE number 710403
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
• scientific article; zbMATH DE number 1263271

Cited in

(22)

• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
• Constrained integer fractional programming problem with box constraints
• Using selective orthonormalization to update the analytic center after addition of multiple cuts
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• 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
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• Cuts for mixed 0-1 conic programming
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
• A note on the primal-dual column generation method for combinatorial optimization
• 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
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• Polynomial Interior Point Cutting Plane Methods
• IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
• An interior point cutting plane heuristic for mixed integer programming
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509760)