On semidefinite programming relaxations of the traveling salesman problem

On semidefinite programming relaxations of the traveling salesman problem

Show other versions (1)

Detalles Bibliográficos
Main Authors:	Klerk, E, Pasechnik, D, Sotirov, R
Formato:	Journal article
Publicado:	2008

Títulos similares

On semidefinite programming relaxations of the traveling salesman problem
por: Klerk, E, et al.
Publicado: (2009)

On semidefinite programming relaxations of the traveling salesman problem
por: De Klerk, Etienne., et al.
Publicado: (2009)

On semidefinite programming relaxations of maximum k−section
por: de Klerk, E, et al.
Publicado: (2012)

On semidefinite programming relaxations of maximum k-section
por: De Klerk, E, et al.
Publicado: (2012)

On semidefinite programming relaxations of maximum k -section
por: Klerk, Etienne de., et al.
Publicado: (2013)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems
por: de Klerk, E, et al.
Publicado: (2009)

Reduction of symmetric semidefinite programs using the regular *−representation
por: de Klerk, E, et al.
Publicado: (2007)

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming
por: de Klerk, E, et al.
Publicado: (2011)

Reduction of symmetric semidefinite programs using the regular representation
por: Klerk, Etienne de., et al.
Publicado: (2012)

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
por: Klerk, Etienne de., et al.
Publicado: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
por: de Klerk, E, et al.
Publicado: (2012)

Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem
por: Goemans, Michel X., et al.
Publicado: (2009)

Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming
por: Klerk, E. de., et al.
Publicado: (2013)

The retrace traveling salesman problem : a new extension of traveling salesman problem /
por: 212543 Juraidawati Arbain
Publicado: (2003)

Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Yongliang Lu, et al.
Publicado: (2022-06-01)

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
por: Mohammed Zia, et al.
Publicado: (2018-03-01)

On the local stability of semidefinite relaxations
por: Cifuentes, Diego, et al.
Publicado: (2022)

An algorithm for the traveling salesman problem,
por: Little, John D. C.
Publicado: (2009)

The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
por: Juraidawati Arbain
Publicado: (2003)

Traveling salesman path problems
por: Lam, Fumei
Publicado: (2006)

Probabilistic Traveling Salesman Problems
por: Jaillet, Patrick
Publicado: (2005)

Traveling Salesman Problem with Transportation
por: Valeriu Ungureanu
Publicado: (2006-09-01)

Variants of the Traveling Salesman Problem
por: Patterson Mike, et al.
Publicado: (2019-04-01)

The retrace traveling salesman problem : a new extension of traveling salesman problem [compact disc] /
por: 212543 Juraidawati Arbain
Publicado: (2003)

The Travelling Salesman Problem and Related Problems
por: Gavish, Bezalel, et al.
Publicado: (2004)

A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
por: Makswell Seyiti Kawashima, et al.
Publicado: (2015-01-01)

Convergent Duality for the Traveling Salesman Problem
por: Shapiro, Jeremy F., 1939-
Publicado: (2004)

Computational Complexity and the Traveling Salesman Problem
por: Johnson, David, et al.
Publicado: (2023)

Trajectory Stability in the Traveling Salesman Problem
por: Sánchez, Sergio, et al.
Publicado: (2018)

Trajectory Stability in the Traveling Salesman Problem
por: Sergio Sánchez, et al.
Publicado: (2018-01-01)

The Pyramidal Method for Traveling Salesman Problem
por: Stefan Pesko
Publicado: (2000-12-01)

Algoritma polinomial dan traveling salesman problem
por: , WIDYASTUTI, Naniek, et al.
Publicado: (1999)

Relaxations of combinatorial problems via association schemes
por: Klerk, E, et al.
Publicado: (2012)

Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
por: Hu, Sha, S.M. Massachusetts Institute of Technology
Publicado: (2007)

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
por: Fernando Mario de Oliveira Filho, et al.
Publicado: (2020-08-01)

A paradox in bosonic energy computations via semidefinite programming relaxations
por: M Navascués, et al.
Publicado: (2013-01-01)

An analysis of several heuristics for the traveling salesman problems /
por: 428771 Rosenkrants, Daniel J., et al.

Comparing two search strategies of branch-and-bound for symmeric standard traveling salesman problem and multiple traveling salesman problems /
por: 500918 Shakila Saad, et al.
Publicado: (2008)

Traveling salesman problem using simulated annealing /
por: 493403 Tan, Chee Thiam, et al.
Publicado: (2008)

Two traveling salesman facility location problems
Publicado: (2003)