Cover and pack inequalities for (mixed) integer programming
From MaRDI portal
Publication:817174
DOI10.1007/s10479-005-3442-1zbMath1091.90053OpenAlexW2074134927MaRDI QIDQ817174
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3442-1
Related Items
Knapsack polytopes: a survey, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, Separation algorithms for 0-1 knapsack polytopes, On the complexity of separation from the knapsack polytope, Lifting the knapsack cover inequalities for the knapsack polytope, Integer programming solution approach for inventory‐production–distribution problems with direct shipments, Lifting for the integer knapsack cover polyhedron, A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints, New classes of facets for complementarity knapsack problems, Formulations and valid inequalities for the capacitated dispersion problem, \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set, Convex hulls of superincreasing knapsacks and lexicographic orderings, On the transportation problem with market choice, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, Supermodular covering knapsack polytope, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Mingling: mixed-integer rounding with bounds, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example, On lifted cover inequalities: a new lifting procedure with unusual properties, New valid inequalities for the fixed-charge and single-node flow polytopes, A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling, The submodular knapsack polytope, Parametric convex quadratic relaxation of the quadratic knapsack problem, Lifting for mixed integer programs with variable upper bounds
Cites Work
- Unnamed Item
- The convex hull of two core capacitated network design problems
- Non-standard approaches to integer programming
- A note on the knapsack problem with special ordered sets
- Cutting planes for integer programs with general integer variables
- The 0-1 knapsack problem with a single continuous variable
- On the \(0/1\) knapsack polytope
- Cyclic group and knapsack facets
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the facets of the mixed-integer knapsack polyhedron
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Polyhedral results for the edge capacity polytope.
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- On capacitated network design cut-set polyhedra
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Sequence independent lifting in mixed integer programming
- Some polyhedra related to combinatorial problems
- Easily Computable Facets of the Knapsack Polytope
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Sequence Independent Lifting for Mixed-Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- Technical Note—A Note on Zero-One Programming
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Facets of the Knapsack Polytope From Minimal Covers
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Covering, Packing and Knapsack Problems
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- The Sequential Knapsack Polytope
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- On the facial structure of set packing polyhedra
- Shortest paths, single origin‐destination network design, and associated polyhedra
- A Polyhedral Study of Integer Variable Upper Bounds
- Integer Programming and Combinatorial Optimization
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Flow pack facets of the single node fixed-charge flow polytope
