scientific article; zbMATH DE number 2246591

zbMath1098.90089MaRDI QIDQ5717954

Kartik Krishnan, Tamás Terlaky

Publication date: 13 January 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingsemidefinite programmingcombinatorial optimizationbranch and cutapproximation algorithms

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (6)

A matrix generation approach for eigenvalue optimization ⋮ Strong duality and minimal representations for cone optimization ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Scalable Semidefinite Programming ⋮ Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization

Uses Software

• CSDP
• Sostools
• SeDuMi
• SDPT3
• PENNON
• GloptiPoly
• SDPLR
• CirCut
• ACCPM
• Outward rotations

This page was built for publication: