New lower bounds for the symmetric travelling salesman problem (Q1824572): Difference between revisions

@@ Property / author @@
-Giorgio Carpaneto
@@ Property / author: Giorgio Carpaneto / rank @@
-Normal rank
@@ Property / author @@
-Paolo Toth
@@ Property / author: Paolo Toth / rank @@
-Normal rank
@@ Property / author @@
+Giorgio Carpaneto
@@ Property / author: Giorgio Carpaneto / rank @@
+Normal rank
@@ Property / author @@
+Paolo Toth
@@ Property / author: Paolo Toth / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the multiple depot vehicle scheduling problem
+Normal rank
@@ Property / cites work @@
+The Shortest Hamiltonian Chain of a Graph
@@ Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Q4205235
@@ Property / cites work: Q4205235 / rank @@
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+An additive bounding procedure for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
+Normal rank
@@ Property / cites work @@
+Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+Q4145160
@@ Property / cites work: Q4145160 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1824572