An improved interior-point cutting-plane method for binary quadratic optimization
DOI10.1016/J.ENDM.2010.05.094zbMATH Open1237.90179OpenAlexW2039616602MaRDI QIDQ2883644FDOQ2883644
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
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
combinatorial optimizationinterior-point methodssemidefinite relaxationscutting-plane methodsbinary quadratic programswarmstarts
Combinatorial optimization (90C27) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- On interior-point warmstarts for linear and combinatorial optimization
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- 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
- On the Identification of Zero Variables in an Interior-Point Framework
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Title not available (Why is that?)
Cited In (3)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Improved row-by-row method for binary quadratic optimization problems
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
Uses Software
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)
