Faces for a linear inequality in 0–1 variables
From MaRDI portal
Publication:4074671
Cites work
- scientific article; zbMATH DE number 3476893 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3358500 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Canonical Cuts on the Unit Hypercube
- Coefficient reduction for inequalities in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Matroids and the greedy algorithm
- Maximum matching and a polyhedron with 0,1-vertices
- Properties of vertex packing and independence system polyhedra
Cited in
(only showing first 100 items - show all)- A branch and cut algorithm for hub location problems with single assignment
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Capacitated facility location: Separation algorithms and computational experience
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- The precedence constrained knapsack problem: separating maximally violated inequalities
- The clique partitioning problem: Facets and patching facets
- Efficient reformulation for 0-1 programs -- methods and computational results
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Maximizing a class of submodular utility functions
- On the mixing set with a knapsack constraint
- The mixing-MIR set with divisible capacities
- Polyhedral results for the precedence-constrained knapsack problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Polyhedral properties for the intersection of two knapsacks
- Cover and pack inequalities for (mixed) integer programming
- On cutting-plane proofs in combinatorial optimization
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- On facets of knapsack equality polytopes
- The generalized assignment problem: Valid inequalities and facets
- Solving a school bus scheduling problem with integer programming
- Requiring connectivity in the set covering problem
- On tightening cover induced inequalities
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- Recoverable robust knapsacks: the discrete scenario case
- Computing low-capacity 0–1 knapsack polytopes
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- A polyhedral study of the semi-continuous knapsack problem
- A combinatorial optimization approach to the selection of statistical units
- Monotone clutters
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Polyhedral analysis for concentrator location problems
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Exploiting nested inequalities and surrogate constraints
- Bidirected and unidirected capacity installation in telecommunication networks.
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- Matroidal relaxations for 0-1 knapsack problems
- Facets and lifting procedures for the set covering polytope
- On the facial structure of the set covering polytope
- (1,k)-configurations and facets for packing problems
- Lifting the facets of zero–one polytopes
- A characterization of threshold matroids
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Strong valid inequalities for Boolean logical pattern generation
- The submodular knapsack polytope
- On lifted cover inequalities: a new lifting procedure with unusual properties
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- Adjacency of the 0-1 knapsack problem
- Cutting planes in integer and mixed integer programming
- Regular (2, 2)-systems
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Separation algorithms for 0-1 knapsack polytopes
- Lifting the knapsack cover inequalities for the knapsack polytope
- Facet defining inequalities for the dichotomous knapsack problem
- Lineare Charakterisierungen von Travelling Salesman Problemen
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Theoretical challenges towards cutting-plane selection
- Second-order cover inequalities
- Branch-and-cut for complementarity-constrained optimization
- RENS. The optimal rounding
- Lifting for the integer knapsack cover polyhedron
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Implicit cover inequalities
- The complexity of lifted inequalities for the knapsack problem
- Valid inequalities for mixed 0-1 programs
- Valid inequalities, cutting planes and integrality of the knapsack polytope
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Knapsack polytopes: a survey
- Strong bounds with cut and column generation for class-teacher timetabling
- LP-based algorithms for capacitated facility location
- Two-set inequalities for the binary knapsack polyhedra
- On the complexity of separating cutting planes for the knapsack polytope
- The transit time constrained fixed charge multi-commodity network design problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- Online joint bid/daily budget optimization of Internet advertising campaigns
- Ordered matroids and regular independence systems
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- On the complexity of separation from the knapsack polytope
- New classes of facets for complementarity knapsack problems
- Precedence-constrained covering problems with multiplicity constraints
- The aggregation closure is polyhedral for packing and covering integer programs
- A Lasserre lower bound for the min-sum single machine scheduling problem
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
- A new sequential lifting of robust cover inequalities
- Precedence-constrained covering problems with multiplicity constraints
- Polyhedral techniques in combinatorial optimization I: Theory
- A note on the continuous mixing set
- Approximate Deadline-Scheduling with Precedence Constraints
- New classes of facets for complementarity knapsack problems
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)
