On the exact separation of mixed integer knapsack cuts (Q543396): Difference between revisions

@@ Property / describes a project that uses @@
+MIPLIB
@@ Property / describes a project that uses: MIPLIB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+gmp
@@ Property / describes a project that uses: gmp / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-009-0284-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2051496747
@@ Property / OpenAlex ID: W2051496747 / rank @@
+Normal rank
@@ Property / cites work @@
+Unbounded knapsack problem: Dynamic programming revisited
+Normal rank
@@ Property / cites work @@
+Q4735941
@@ Property / cites work: Q4735941 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solutions to linear programming problems
@@ Property / cites work: Exact solutions to linear programming problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+Sequence Independent Lifting for Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+A computational study of exact knapsack separation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
+Normal rank
@@ Property / cites work @@
+Optimizing over the split closure
@@ Property / cites work: Optimizing over the split closure / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Projected Chvátal-Gomory cuts for mixed integer linear programs
+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 @@
+Chvátal closures for mixed integer programming problems
+Normal rank
@@ Property / cites work @@
+K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+On the strength of Gomory mixed-integer cuts as group cuts
+Normal rank
@@ Property / cites work @@
+On the MIR Closure of Polyhedra
@@ Property / cites work: On the MIR Closure of Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+A linear algorithm for integer programming in the plane
+Normal rank
@@ Property / cites work @@
+Q2861491
@@ Property / cites work: Q2861491 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing over the first Chvátal closure
@@ Property / cites work: Optimizing over the first Chvátal closure / rank @@
+Normal rank
@@ Property / cites work @@
+A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts
+Normal rank
@@ Property / cites work @@
+A new dominance procedure for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Early Integer Programming
@@ Property / cites work: Early Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Some continuous functions related to corner polyhedra
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting in mixed integer programming
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+The Power of Dominance Relations in Branch-and-Bound Algorithms
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the Two-Variable Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+Separation algorithms for 0-1 knapsack polytopes
@@ Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing and Probing Techniques for Mixed Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Production Sets with Indivisibilities, Part II: The Case of Two Activities
+Normal rank
@@ Property / cites work @@
+Technical Note—Facets and Strong Valid Inequalities for Integer Programs
+Normal rank
@@ Property / cites work @@
+Cutting planes for mixed-integer knapsack polyhedra
+Normal rank
@@ Property / cites work @@
+Lifting the facets of zero–one polytopes
@@ Property / cites work: Lifting the facets of zero–one polytopes / rank @@
+Normal rank