Semidefinite relaxations for mixed 0-1 second-order cone program

DOI10.1007/978-3-642-32147-4_9MaRDI QIDQ3167614zbMATH OpenOpenAlexFDO

Authors Agnès Gorge, Abdel Lisser, Riadh Zorgati

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_9

zbMATH Keywords

combinatorial optimizationmixed-integer second-order cone programquadratically constrained quadratic programsemidefinite relaxation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Semidefinite programming (90C22) Combinatorial optimization (90C27)

Recommendations

• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Semidefinite approximation for mixed binary quadratically constrained quadratic programs
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
• Combining semidefinite and polyhedral relaxations for integer programs
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

Cited in

(3)

• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• scientific article; zbMATH DE number 5124934 (Why is no real title available?)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming

This page was built for publication: Semidefinite relaxations for mixed 0-1 second-order cone program

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