Cover and pack inequalities for (mixed) integer programming
From MaRDI portal
Recommendations
- Approximation of optima of integer programs of the packing—covering type
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Approximation algorithms for covering/packing integer programs
- Approximating covering integer programs with multiplicity constraints
- Packing and covering with linear programming: a survey
- Combinatorial problems of packing and covering and related problems of integer linear program\-ming
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Packing interdiction and partial covering problems
Cites work
- scientific article; zbMATH DE number 3874956 (Why is no real title available?)
- (1,k)-configurations and facets for packing problems
- A Polyhedral Study of Integer Variable Upper Bounds
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- A note on the knapsack problem with special ordered sets
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Covering, Packing and Knapsack Problems
- Cutting planes for integer programs with general integer variables
- Cyclic group and knapsack facets
- Easily Computable Facets of the Knapsack Polytope
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the Knapsack Polytope From Minimal Covers
- Facets of the knapsack polytope
- Flow pack facets of the single node fixed-charge flow polytope
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- Integer Programming and Combinatorial Optimization
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifting the facets of zero–one polytopes
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Non-standard approaches to integer programming
- On capacitated network design cut-set polyhedra
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the \(0/1\) knapsack polytope
- On the facets of the mixed-integer knapsack polyhedron
- On the facial structure of set packing polyhedra
- Polyhedral results for the edge capacity polytope.
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Solving Large-Scale Zero-One Linear Programming Problems
- Some polyhedra related to combinatorial problems
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The 0-1 knapsack problem with a single continuous variable
- The Sequential Knapsack Polytope
- The convex hull of two core capacitated network design problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(36)- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- Lifting the knapsack cover inequalities for the knapsack polytope
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Lifting for the integer knapsack cover polyhedron
- New classes of facets for complementarity knapsack problems
- Knapsack polytopes: a survey
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- New classes of facets for complementarity knapsack problems
- On the complexity of separating cutting planes for the knapsack polytope
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Second-order cover inequalities
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- On the complexity of separation from the knapsack polytope
- Lifting for mixed integer programs with variable upper bounds
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Mingling: mixed-integer rounding with bounds
- On the transportation problem with market choice
- Separation algorithms for 0-1 knapsack polytopes
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Formulations and valid inequalities for the capacitated dispersion problem
- On the knapsack closure of 0-1 integer linear programs
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- The submodular knapsack polytope
- Supermodular covering knapsack polytope
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
This page was built for publication: Cover and pack inequalities for (mixed) integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817174)
