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)