An improved interior-point cutting-plane method for binary quadratic optimization

DOI10.1016/J.ENDM.2010.05.094MaRDI QIDQ2883644zbMATH OpenOpenAlexFDO

Authors Alexander Engau, Miguel F. Anjos, Anthony Vannelli

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.094

zbMATH Keywords

combinatorial optimizationinterior-point methodssemidefinite relaxationscutting-plane methodsbinary quadratic programswarmstarts

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
• scientific article; zbMATH DE number 2196287
• scientific article; zbMATH DE number 1182577
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 2159019 (Why is no real title available?)
• scientific article; zbMATH DE number 2196287 (Why is no real title available?)
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Handbook of semidefinite programming. Theory, algorithms, and applications
• On Semidefinite Programming Relaxations of the Traveling Salesman Problem
• On interior-point warmstarts for linear and combinatorial optimization
• On the Identification of Zero Variables in an Interior-Point Framework
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Cited in

(3)

• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
• Improved row-by-row method for binary quadratic optimization problems
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems

Describes a project that uses

Uses Software

• Biq Mac

This page was built for publication: An improved interior-point cutting-plane method for binary quadratic optimization

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