Pages that link to "Item:Q3648520"

The following pages link to On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3648520):

Displaying 21 items.

• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← 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)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
• Gaddum's test for symmetric cones (Q2022297) (← links)
• Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• The symmetric quadratic traveling salesman problem (Q2434982) (← links)
• Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
• Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)