A fundamental problem in linear inequalities with applications to the travelling salesman problem (Q5663633): Difference between revisions

@@ Property / cites work @@
+On the Set-Covering Problem
@@ Property / cites work: On the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming: Methods, Uses, Computations
@@ Property / cites work: Integer Programming: Methods, Uses, Computations / rank @@
+Normal rank
@@ Property / cites work @@
+An Approach to Zero-One Integer Programming
@@ Property / cites work: An Approach to Zero-One Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Linear Programming and Integer Feasibility
+Normal rank
@@ Property / cites work @@
+On the Tours of a Traveling Salesman
@@ Property / cites work: On the Tours of a Traveling Salesman / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacency on Convex Polyhedra
@@ Property / cites work: Adjacency on Convex Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401222
@@ Property / cites work: Q4401222 / rank @@
+Normal rank
@@ Property / cites work @@
+On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
+Normal rank
@@ Property / cites work @@
+Computer Solutions to Minimum-Cover Problems
@@ Property / cites work: Computer Solutions to Minimum-Cover Problems / rank @@
+Normal rank