The following pages link to (Q4517107):
Displaying 13 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Discrete optimization: an Austrian view (Q537581) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
