Pages that link to "Item:Q431008"
From MaRDI portal
The following pages link to Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008):
Displaying 12 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← 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)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
