A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229): Difference between revisions

@@ Property / cites work @@
+A Simple Algorithm for Integer Programs Using Group Constraints
+Normal rank
@@ Property / cites work @@
+Efficient group cuts for integer programs
@@ Property / cites work: Efficient group cuts for integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+A Convergent Duality Theory for Integer Programming
+Normal rank
@@ Property / cites work @@
+Transformation of integer programs to knapsack problems
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the solution of the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Aggregation of Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Technical Note—Solving Integer Programming Problems by Aggregating Constraints
+Normal rank