Description of 2-integer continuous knapsack polyhedra (Q2506817): Difference between revisions

@@ Property / cites work @@
+A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
+Normal rank
@@ Property / cites work @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with a single continuous variable
+Normal rank
@@ Property / cites work @@
+Mixing mixed-integer inequalities
@@ Property / cites work: Mixing mixed-integer inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the Two-Variable Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to a production planning problem
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+On the dimension of projected polyhedra
@@ Property / cites work: On the dimension of projected polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Twistor spaces and harmonic maps
@@ Property / cites work: Twistor spaces and harmonic maps / rank @@
+Normal rank
@@ Property / cites work @@
+Hilbert Bases and the Facets of Special Knapsack Polytopes
+Normal rank