On semidefinite programming relaxations of the traveling salesman problem

On semidefinite programming relaxations of the traveling salesman problem

Pokaži ostale verzije (1)

Bibliografski detalji
Glavni autori:	Klerk, E, Pasechnik, D, Sotirov, R
Format:	Journal article
Izdano:	2008

Slični predmeti

On semidefinite programming relaxations of the traveling salesman problem
od: Klerk, E, i dr.
Izdano: (2009)

On semidefinite programming relaxations of the traveling salesman problem
od: De Klerk, Etienne., i dr.
Izdano: (2009)

On semidefinite programming relaxations of maximum k−section
od: de Klerk, E, i dr.
Izdano: (2012)

On semidefinite programming relaxations of maximum k-section
od: De Klerk, E, i dr.
Izdano: (2012)

On semidefinite programming relaxations of maximum k -section
od: Klerk, Etienne de., i dr.
Izdano: (2013)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems
od: de Klerk, E, i dr.
Izdano: (2009)

Reduction of symmetric semidefinite programs using the regular *−representation
od: de Klerk, E, i dr.
Izdano: (2007)

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming
od: de Klerk, E, i dr.
Izdano: (2011)

Reduction of symmetric semidefinite programs using the regular representation
od: Klerk, Etienne de., i dr.
Izdano: (2012)

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
od: Klerk, Etienne de., i dr.
Izdano: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
od: de Klerk, E, i dr.
Izdano: (2012)

Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem
od: Goemans, Michel X., i dr.
Izdano: (2009)

Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming
od: Klerk, E. de., i dr.
Izdano: (2013)

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

Solving the clustered traveling salesman problem via traveling salesman problem methods
od: Yongliang Lu, i dr.
Izdano: (2022-06-01)

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
od: Mohammed Zia, i dr.
Izdano: (2018-03-01)

On the local stability of semidefinite relaxations
od: Cifuentes, Diego, i dr.
Izdano: (2022)

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

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

Traveling salesman path problems
od: Lam, Fumei
Izdano: (2006)

Probabilistic Traveling Salesman Problems
od: Jaillet, Patrick
Izdano: (2005)

Traveling Salesman Problem with Transportation
od: Valeriu Ungureanu
Izdano: (2006-09-01)

Variants of the Traveling Salesman Problem
od: Patterson Mike, i dr.
Izdano: (2019-04-01)

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

The Travelling Salesman Problem and Related Problems
od: Gavish, Bezalel, i dr.
Izdano: (2004)

A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
od: Makswell Seyiti Kawashima, i dr.
Izdano: (2015-01-01)

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

Computational Complexity and the Traveling Salesman Problem
od: Johnson, David, i dr.
Izdano: (2023)

Trajectory Stability in the Traveling Salesman Problem
od: Sánchez, Sergio, i dr.
Izdano: (2018)

Trajectory Stability in the Traveling Salesman Problem
od: Sergio Sánchez, i dr.
Izdano: (2018-01-01)

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

Algoritma polinomial dan traveling salesman problem
od: , WIDYASTUTI, Naniek, i dr.
Izdano: (1999)

Relaxations of combinatorial problems via association schemes
od: Klerk, E, i dr.
Izdano: (2012)

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

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
od: Fernando Mario de Oliveira Filho, i dr.
Izdano: (2020-08-01)

A paradox in bosonic energy computations via semidefinite programming relaxations
od: M Navascués, i dr.
Izdano: (2013-01-01)

An analysis of several heuristics for the traveling salesman problems /
od: 428771 Rosenkrants, Daniel J., i dr.

Comparing two search strategies of branch-and-bound for symmeric standard traveling salesman problem and multiple traveling salesman problems /
od: 500918 Shakila Saad, i dr.
Izdano: (2008)

Traveling salesman problem using simulated annealing /
od: 493403 Tan, Chee Thiam, i dr.
Izdano: (2008)

Two traveling salesman facility location problems
Izdano: (2003)