Technical Note—Facets and Strong Valid Inequalities for Integer Programs

DOI10.1287/OPRE.24.2.367MaRDI QIDQ4108138zbMATH OpenOpenAlexFDO

Authors Laurence A. Wolsey

Publication date 1976

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.24.2.367

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Integer programming (90C10)

Cited in

(42)

• Valid inequalities for mips and group polyhedra from approximate liftings
• On tightening cover induced inequalities
• Cutting planes for integer programs with general integer variables
• Future paths for integer programming and links to artificial intelligence
• On a generalization of the master cyclic group polyhedron
• Polyhedral properties of the induced cluster subgraphs
• Multi-cover inequalities for totally-ordered multiple knapsack sets
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• A cutting plane method for knapsack polytope
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Lifting the knapsack cover inequalities for the knapsack polytope
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Generalized cover facet inequalities for the generalized assignment problem
• Lifting the facets of zero–one polytopes
• The precedence constrained knapsack problem: separating maximally violated inequalities
• Sequence independent lifting of cover inequalities
• On the exact separation of mixed integer knapsack cuts
• Classical cuts for mixed-integer programming and branch-and-cut
• Lifting convex inequalities for bipartite bilinear programs
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Lifting convex inequalities for bipartite bilinear programs
• A family of inequalities for the generalized assignment polytope
• Lifting for the integer knapsack cover polyhedron
• Lifting, tilting and fractional programming revisited
• Lifting for conic mixed-integer programming
• Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis
• Two-set inequalities for the binary knapsack polyhedra
• Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
• An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
• Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
• Cover and pack inequalities for (mixed) integer programming
• Knapsack polytopes: a survey
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• The generalized assignment problem: Valid inequalities and facets
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
• Nonconvex, lower semicontinuous piecewise linear optimization
• A computational study of exact knapsack separation for the generalized assignment problem

This page was built for publication: Technical Note—Facets and Strong Valid Inequalities for Integer Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4108138)