scientific article; zbMATH DE number 1342125
From MaRDI portal
Publication:4263707
zbMath0948.90114MaRDI QIDQ4263707
Mirjana Čangalović, Vera V. Kovacevic-Vujcic, Dragos Cvetković
Publication date: 22 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundsemidefinite relaxationssymmetric traveling salesman problemdiscrete semidefinite programming
Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (13)
Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps ⋮ The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem ⋮ Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP ⋮ Theorems of the alternative for conic integer programming ⋮ A semidefinite optimization approach to the target visitation problem ⋮ Graph spectra in computer science ⋮ Hidden Hamiltonian Cycle Recovery via Linear Programming ⋮ Gaddum's test for symmetric cones ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ Relaxations of Combinatorial Problems Via Association Schemes ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Cuts for mixed 0-1 conic programming
This page was built for publication:
