Cited in
(19)- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
- Solving large-scale semidefinite programs in parallel
- LFTB
- PENSDP
- lambda
- SDPARA
- SDP_S
- Lurupa
- EIQP IIQP
- MIQCR-CB
- Sp
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- On verified numerical computations in convex programming
- Semidefinite programming relaxations and algebraic optimization in control
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
This page was built for software: SBmethod
