On semidefinite programming relaxations of the traveling salesman problem

On semidefinite programming relaxations of the traveling salesman problem

अन्य संस्करण दिखाएं (1)

ग्रंथसूची विवरण
मुख्य लेखकों:	Klerk, E, Pasechnik, D, Sotirov, R
स्वरूप:	Journal article
प्रकाशित:	2008

समान संसाधन

On semidefinite programming relaxations of the traveling salesman problem
द्वारा: Klerk, E, और अन्य
प्रकाशित: (2009)

On semidefinite programming relaxations of the traveling salesman problem
द्वारा: De Klerk, Etienne., और अन्य
प्रकाशित: (2009)

On semidefinite programming relaxations of maximum k−section
द्वारा: de Klerk, E, और अन्य
प्रकाशित: (2012)

On semidefinite programming relaxations of maximum k-section
द्वारा: De Klerk, E, और अन्य
प्रकाशित: (2012)

On semidefinite programming relaxations of maximum k -section
द्वारा: Klerk, Etienne de., और अन्य
प्रकाशित: (2013)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems
द्वारा: de Klerk, E, और अन्य
प्रकाशित: (2009)

Reduction of symmetric semidefinite programs using the regular *−representation
द्वारा: de Klerk, E, और अन्य
प्रकाशित: (2007)

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming
द्वारा: de Klerk, E, और अन्य
प्रकाशित: (2011)

Reduction of symmetric semidefinite programs using the regular representation
द्वारा: Klerk, Etienne de., और अन्य
प्रकाशित: (2012)

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
द्वारा: Klerk, Etienne de., और अन्य
प्रकाशित: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
द्वारा: de Klerk, E, और अन्य
प्रकाशित: (2012)

Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem
द्वारा: Goemans, Michel X., और अन्य
प्रकाशित: (2009)

Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming
द्वारा: Klerk, E. de., और अन्य
प्रकाशित: (2013)

The retrace traveling salesman problem : a new extension of traveling salesman problem /
द्वारा: 212543 Juraidawati Arbain
प्रकाशित: (2003)

Solving the clustered traveling salesman problem via traveling salesman problem methods
द्वारा: Yongliang Lu, और अन्य
प्रकाशित: (2022-06-01)

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
द्वारा: Mohammed Zia, और अन्य
प्रकाशित: (2018-03-01)

On the local stability of semidefinite relaxations
द्वारा: Cifuentes, Diego, और अन्य
प्रकाशित: (2022)

An algorithm for the traveling salesman problem,
द्वारा: Little, John D. C.
प्रकाशित: (2009)

The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
द्वारा: Juraidawati Arbain
प्रकाशित: (2003)

Traveling salesman path problems
द्वारा: Lam, Fumei
प्रकाशित: (2006)

Probabilistic Traveling Salesman Problems
द्वारा: Jaillet, Patrick
प्रकाशित: (2005)

Traveling Salesman Problem with Transportation
द्वारा: Valeriu Ungureanu
प्रकाशित: (2006-09-01)

Variants of the Traveling Salesman Problem
द्वारा: Patterson Mike, और अन्य
प्रकाशित: (2019-04-01)

The retrace traveling salesman problem : a new extension of traveling salesman problem [compact disc] /
द्वारा: 212543 Juraidawati Arbain
प्रकाशित: (2003)

The Travelling Salesman Problem and Related Problems
द्वारा: Gavish, Bezalel, और अन्य
प्रकाशित: (2004)

A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
द्वारा: Makswell Seyiti Kawashima, और अन्य
प्रकाशित: (2015-01-01)

Convergent Duality for the Traveling Salesman Problem
द्वारा: Shapiro, Jeremy F., 1939-
प्रकाशित: (2004)

Computational Complexity and the Traveling Salesman Problem
द्वारा: Johnson, David, और अन्य
प्रकाशित: (2023)

Trajectory Stability in the Traveling Salesman Problem
द्वारा: Sánchez, Sergio, और अन्य
प्रकाशित: (2018)

Trajectory Stability in the Traveling Salesman Problem
द्वारा: Sergio Sánchez, और अन्य
प्रकाशित: (2018-01-01)

The Pyramidal Method for Traveling Salesman Problem
द्वारा: Stefan Pesko
प्रकाशित: (2000-12-01)

Algoritma polinomial dan traveling salesman problem
द्वारा: , WIDYASTUTI, Naniek, और अन्य
प्रकाशित: (1999)

Relaxations of combinatorial problems via association schemes
द्वारा: Klerk, E, और अन्य
प्रकाशित: (2012)

Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
द्वारा: Hu, Sha, S.M. Massachusetts Institute of Technology
प्रकाशित: (2007)

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
द्वारा: Fernando Mario de Oliveira Filho, और अन्य
प्रकाशित: (2020-08-01)

A paradox in bosonic energy computations via semidefinite programming relaxations
द्वारा: M Navascués, और अन्य
प्रकाशित: (2013-01-01)

An analysis of several heuristics for the traveling salesman problems /
द्वारा: 428771 Rosenkrants, Daniel J., और अन्य

Comparing two search strategies of branch-and-bound for symmeric standard traveling salesman problem and multiple traveling salesman problems /
द्वारा: 500918 Shakila Saad, और अन्य
प्रकाशित: (2008)

Traveling salesman problem using simulated annealing /
द्वारा: 493403 Tan, Chee Thiam, और अन्य
प्रकाशित: (2008)

Two traveling salesman facility location problems
प्रकाशित: (2003)