Cutting planes for mixed 0-1 semidefinite programs

DOI10.1007/3-540-45535-3_20MaRDI QIDQ4537748zbMATH OpenFDO

Authors G. Iyengar, Tolga Çezik

Publication date 20 June 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810251

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Semidefinite programming
• Semidefinite programming and integer programming
• scientific article; zbMATH DE number 1944141
• Semidefinite programming in combinatorial optimization
• scientific article; zbMATH DE number 1031414

Cited in

(7)

• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Cuts for mixed 0-1 conic programming
• A unifying framework for several cutting plane methods for semidefinite programming
• On the redundancy of cutting planes for linear complementarity problems
• scientific article; zbMATH DE number 1182577 (Why is no real title available?)
• scientific article; zbMATH DE number 6135091 (Why is no real title available?)

Describes a project that uses

Uses Software

• COL

This page was built for publication: Cutting planes for mixed 0-1 semidefinite programs

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