The traveling salesman problem on a graph and some related integer polyhedra (Q3675933): Difference between revisions

@@ Property / author @@
-Jean Fonlupt
@@ Property / author: Jean Fonlupt / rank @@
-Normal rank
@@ Property / author @@
+Jean Fonlupt
@@ Property / author: Jean Fonlupt / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q96162135
@@ Property / Wikidata QID: Q96162135 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Halin graphs and the travelling salesman problem
@@ Property / cites work: Halin graphs and the travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A new class of cutting planes for the symmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+On the relationship between the biconnectivity augmentation and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem I: Inequalities
+Normal rank
@@ Property / cites work @@
+Q4080661
@@ Property / cites work: Q4080661 / rank @@
+Normal rank
@@ Property / cites work @@
+Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01582008
+Normal rank
@@ Property / OpenAlex ID @@
+W2083210138
@@ Property / OpenAlex ID: W2083210138 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3675933