The following pages link to (Q4263707):
Displaying 11 items.
- Graph spectra in computer science (Q627958) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Gaddum's test for symmetric cones (Q2022297) (← links)
- Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
- Theorems of the alternative for conic integer programming (Q2183216) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
