scientific article; zbMATH DE number 2246591
From MaRDI portal
Publication:5717954
approximation algorithmsbranch and cutcombinatorial optimizationlinear programmingsemidefinite programming
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Semidefinite programming (90C22) Combinatorial optimization (90C27) Interior-point methods (90C51) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- scientific article; zbMATH DE number 1302172
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- scientific article; zbMATH DE number 1031414
- Semidefinite programming and combinatorial optimization
Cited in
(12)- Topics in semidefinite and interior-point methods
- Strong duality and minimal representations for cone optimization
- Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization
- 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
- Matrix relaxations in combinatorial optimization
- scientific article; zbMATH DE number 1302172 (Why is no real title available?)
- scientific article; zbMATH DE number 724202 (Why is no real title available?)
- scientific article; zbMATH DE number 1047684 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Scalable semidefinite programming
- A matrix generation approach for eigenvalue optimization
Describes a project that uses
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717954)
