Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037): Difference between revisions

@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On the Set-Covering Problem
@@ Property / cites work: On the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Set-Covering Problem: II. An Algorithm for Set Partitioning
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and weakly hamiltonian graphs
@@ Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675139
@@ Property / cites work: Q5675139 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4174517
@@ Property / cites work: Q4174517 / rank @@
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+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 @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5659340
@@ Property / cites work: Q5659340 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585875
@@ Property / cites work: Q5585875 / rank @@
+Normal rank
@@ Property / cites work @@
+A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—A Note on Zero-One Programming
@@ Property / cites work: Technical Note—A Note on Zero-One Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The travelling salesman problem and a class of polyhedra of diameter two
+Normal rank
@@ Property / cites work @@
+Q5677286
@@ Property / cites work: Q5677286 / rank @@
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01918456
+Normal rank
@@ Property / OpenAlex ID @@
+W1998736169
@@ Property / OpenAlex ID: W1998736169 / rank @@
+Normal rank