Pages that link to "Item:Q3565247"
From MaRDI portal
The following pages link to Semidefinite Relaxations for Integer Programming (Q3565247):
Displayed 12 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Immediate schedule adjustment and semidefinite relaxation (Q2313755) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- (Q5053241) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)