Cutting planes for mixed-integer knapsack polyhedra (Q1290620): Difference between revisions

@@ Property / describes a project that uses @@
+MINTO
@@ Property / describes a project that uses: MINTO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
+Normal rank
@@ Property / cites work @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+Fenchel Cutting Planes for Integer Programs
@@ Property / cites work: Fenchel Cutting Planes for Integer Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Fenchel Cutting Planes for Knapsack Polyhedra
+Normal rank
@@ Property / cites work @@
+On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
+Normal rank