Faces for a linear inequality in 0–1 variables

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

Properties of vertex packing and independence system polyhedra
Facet of regular 0–1 polytopes
Facets of the knapsack polytope
Maximum matching and a polyhedron with 0,1-vertices
Title not available (Why is that?)
Canonical Cuts on the Unit Hypercube
Title not available (Why is that?)
Matroids and the greedy algorithm
Coefficient reduction for inequalities in 0–1 variables
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems
Idealness and 2-resistant sets
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
New classes of facets for complementarity knapsack problems
Discrete relaxations of combinatorial programs
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
Title not available (Why is that?)
On the linear description of the 3-cycle polytope
New classes of facets for complementarity knapsack problems
Online joint bid/daily budget optimization of Internet advertising campaigns
Generalized cover facet inequalities for the generalized assignment problem
On the complexity of separating cutting planes for the knapsack polytope
Strong IP formulations need large coefficients
Ordered matroids and regular independence systems
On the complexity of separation from the knapsack polytope
Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
Polyhedral techniques in combinatorial optimization I: Theory
Approximate Deadline-Scheduling with Precedence Constraints
Parametric convex quadratic relaxation of the quadratic knapsack problem
A note on characterizing canonical cuts using geometry
Aggregation-based cutting-planes for packing and covering integer programs
Some integer programs arising in the design of main frame computers
Sequence independent lifting for mixed knapsack problems with GUB constraints
Multidimensional sum-up rounding for integer programming in optimal experimental design
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
A cut-and-branch algorithm for the quadratic knapsack problem
The transit time constrained fixed charge multi-commodity network design problem
A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
New valid inequalities for the fixed-charge and single-node flow polytopes
Optimization algorithms for the disjunctively constrained knapsack problem
A Lasserre lower bound for the min-sum single machine scheduling problem
A new sequential lifting of robust cover inequalities
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
Precedence-constrained covering problems with multiplicity constraints
Sum-of-squares hierarchy lower bounds for symmetric formulations
Two-set inequalities for the binary knapsack polyhedra
Supermodular covering knapsack polytope
Precedence-constrained covering problems with multiplicity constraints
The aggregation closure is polyhedral for packing and covering integer programs
A note on the continuous mixing set
Polyhedral results for the precedence-constrained knapsack problem
Formulations and valid inequalities for the heterogeneous vehicle routing problem
Capacitated facility location: Separation algorithms and computational experience
Monotone clutters
Lifting the knapsack cover inequalities for the knapsack polytope
The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
Light on the infinite group relaxation. I: Foundations and taxonomy
Implicit cover inequalities
Valid inequalities, cutting planes and integrality of the knapsack polytope
Lifting for the integer knapsack cover polyhedron
The complexity of lifted inequalities for the knapsack problem
Matroidal relaxations for 0-1 knapsack problems
A Lagrangian relaxation approach to the edge-weighted clique problem
A characterization of threshold matroids
An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
The generalized assignment problem: Valid inequalities and facets
Knapsack polytopes: a survey
On tightening cover induced inequalities
Convex hulls of superincreasing knapsacks and lexicographic orderings
The clique partitioning problem: Facets and patching facets
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
Polyhedral analysis for concentrator location problems
Exploiting nested inequalities and surrogate constraints
On cutting-plane proofs in combinatorial optimization
On the mixing set with a knapsack constraint
The mixing-MIR set with divisible capacities
Theoretical challenges towards cutting-plane selection
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Efficient reformulation for 0-1 programs -- methods and computational results
Bidirected and unidirected capacity installation in telecommunication networks.
On lifted cover inequalities: a new lifting procedure with unusual properties
Facet defining inequalities for the dichotomous knapsack problem
Frequency assignment in mobile radio systems using branch-and-cut techniques
Second-order cover inequalities
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
\(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
Polyhedral properties for the intersection of two knapsacks
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
A combinatorial optimization approach to the selection of statistical units
Facets and lifting procedures for the set covering polytope
On the facial structure of the set covering polytope
Strong bounds with cut and column generation for class-teacher timetabling
Regular (2, 2)-systems
Lineare Charakterisierungen von Travelling Salesman Problemen
Cover and pack inequalities for (mixed) integer programming
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Strong valid inequalities for Boolean logical pattern generation
Recoverable robust knapsacks: the discrete scenario case
Separation algorithms for 0-1 knapsack polytopes
RENS. The optimal rounding
A branch and cut algorithm for hub location problems with single assignment
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
Solving a school bus scheduling problem with integer programming
Computing low-capacity 0–1 knapsack polytopes
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Branch-and-cut for complementarity-constrained optimization

This page was built for publication: Faces for a linear inequality in 0–1 variables

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