Technical Note—Facets and Strong Valid Inequalities for Integer Programs

DOI10.1287/OPRE.24.2.367zbMath0339.90036OpenAlexW2034186905MaRDI QIDQ4108138

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

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

Related Items (37)

Knapsack polytopes: a survey ⋮ The project scheduling polyhedron: Dimension, facets and lifting theorems ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ A cutting plane method for knapsack polytope ⋮ Lifting the knapsack cover inequalities for the knapsack polytope ⋮ Valid inequalities for mixed-integer programmes with fixed charges on sets of variables ⋮ Lifting, tilting and fractional programming revisited ⋮ Sequence independent lifting of cover inequalities ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Lifting for conic mixed-integer programming ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ On a generalization of the master cyclic group polyhedron ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ On tightening cover induced inequalities ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ On the exact separation of mixed integer knapsack cuts ⋮ A family of inequalities for the generalized assignment polytope ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Lifting the facets of zero–one polytopes ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable ⋮ Valid inequalities for mips and group polyhedra from approximate liftings ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets ⋮ Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Cutting planes for integer programs with general integer variables ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Cover and pack inequalities for (mixed) integer programming

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