On semidefinite programming relaxations of the traveling salesman problem

On semidefinite programming relaxations of the traveling salesman problem

Afficher d'autres versions (1)

Détails bibliographiques
Auteurs principaux:	Klerk, E, Pasechnik, D, Sotirov, R
Format:	Journal article
Publié:	2008

Documents similaires

On semidefinite programming relaxations of the traveling salesman problem
par: Klerk, E, et autres
Publié: (2009)

On semidefinite programming relaxations of the traveling salesman problem
par: De Klerk, Etienne., et autres
Publié: (2009)

On semidefinite programming relaxations of maximum k−section
par: de Klerk, E, et autres
Publié: (2012)

On semidefinite programming relaxations of maximum k-section
par: De Klerk, E, et autres
Publié: (2012)

On semidefinite programming relaxations of maximum k -section
par: Klerk, Etienne de., et autres
Publié: (2013)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems
par: de Klerk, E, et autres
Publié: (2009)

Reduction of symmetric semidefinite programs using the regular *−representation
par: de Klerk, E, et autres
Publié: (2007)

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming
par: de Klerk, E, et autres
Publié: (2011)

Reduction of symmetric semidefinite programs using the regular representation
par: Klerk, Etienne de., et autres
Publié: (2012)

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
par: Klerk, Etienne de., et autres
Publié: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
par: de Klerk, E, et autres
Publié: (2012)

Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem
par: Goemans, Michel X., et autres
Publié: (2009)

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

The retrace traveling salesman problem : a new extension of traveling salesman problem /
par: 212543 Juraidawati Arbain
Publié: (2003)

Solving the clustered traveling salesman problem via traveling salesman problem methods
par: Yongliang Lu, et autres
Publié: (2022-06-01)

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
par: Mohammed Zia, et autres
Publié: (2018-03-01)

On the local stability of semidefinite relaxations
par: Cifuentes, Diego, et autres
Publié: (2022)

An algorithm for the traveling salesman problem,
par: Little, John D. C.
Publié: (2009)

The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
par: Juraidawati Arbain
Publié: (2003)

Traveling salesman path problems
par: Lam, Fumei
Publié: (2006)

Probabilistic Traveling Salesman Problems
par: Jaillet, Patrick
Publié: (2005)

Traveling Salesman Problem with Transportation
par: Valeriu Ungureanu
Publié: (2006-09-01)

Variants of the Traveling Salesman Problem
par: Patterson Mike, et autres
Publié: (2019-04-01)

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

The Travelling Salesman Problem and Related Problems
par: Gavish, Bezalel, et autres
Publié: (2004)

A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
par: Makswell Seyiti Kawashima, et autres
Publié: (2015-01-01)

Convergent Duality for the Traveling Salesman Problem
par: Shapiro, Jeremy F., 1939-
Publié: (2004)

Computational Complexity and the Traveling Salesman Problem
par: Johnson, David, et autres
Publié: (2023)

Trajectory Stability in the Traveling Salesman Problem
par: Sánchez, Sergio, et autres
Publié: (2018)

Trajectory Stability in the Traveling Salesman Problem
par: Sergio Sánchez, et autres
Publié: (2018-01-01)

The Pyramidal Method for Traveling Salesman Problem
par: Stefan Pesko
Publié: (2000-12-01)

Algoritma polinomial dan traveling salesman problem
par: , WIDYASTUTI, Naniek, et autres
Publié: (1999)

Relaxations of combinatorial problems via association schemes
par: Klerk, E, et autres
Publié: (2012)

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

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
par: Fernando Mario de Oliveira Filho, et autres
Publié: (2020-08-01)

A paradox in bosonic energy computations via semidefinite programming relaxations
par: M Navascués, et autres
Publié: (2013-01-01)

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

Comparing two search strategies of branch-and-bound for symmeric standard traveling salesman problem and multiple traveling salesman problems /
par: 500918 Shakila Saad, et autres
Publié: (2008)

Traveling salesman problem using simulated annealing /
par: 493403 Tan, Chee Thiam, et autres
Publié: (2008)

Two traveling salesman facility location problems
Publié: (2003)