Facet of regular 0–1 polytopes
From MaRDI portal
Publication:4074672
DOI10.1007/BF01580442zbMATH Open0314.90064OpenAlexW1967535666MaRDI QIDQ4074672FDOQ4074672
Authors: Peter L. Hammer, Uri N. Peled, Ellis L. Johnson 
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580442
Cites Work
- Properties of vertex packing and independence system polyhedra
- Some polyhedra related to combinatorial problems
- Canonical Cuts on the Unit Hypercube
- Edmonds polytopes and a hierarchy of combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (96)
- Idealness and 2-resistant sets
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A note on the implications of approximate submodularity in discrete optimization
- Ordered matroids and regular independence systems
- Polyhedral techniques in combinatorial optimization I: Theory
- Approximate Deadline-Scheduling with Precedence Constraints
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Approximate and exact merging of knapsack constraints with cover inequalities
- Some integer programs arising in the design of main frame computers
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Optimum Solution of the Closest String Problem via Rank Distance
- The transit time constrained fixed charge multi-commodity network design problem
- Optimization algorithms for the disjunctively constrained knapsack problem
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- A note on the continuous mixing set
- Polyhedral approaches to learning Bayesian networks
- Polyhedral results for the precedence-constrained knapsack problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Mathematical programming approaches for generating \(p\)-efficient points
- Implicit cover inequalities
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Valid inequalities, cutting planes and integrality of the knapsack polytope
- The complexity of lifted inequalities for the knapsack problem
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- The generalized assignment problem: Valid inequalities and facets
- Knapsack polytopes: a survey
- A polyhedral investigation of star colorings
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- On tightening cover induced inequalities
- On the completability of incomplete Latin squares
- 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
- Future paths for integer programming and links to artificial intelligence
- Integer-programming software systems
- On Latin squares and the facial structure of related polytopes
- On cutting-plane proofs in combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- The maximum \(k\)-colorable subgraph problem and orbitopes
- 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
- Approximation algorithms for covering/packing integer programs
- Facet defining inequalities for the dichotomous knapsack problem
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Polytopes associated with symmetry handling
- Time-tables, polyhedra and the greedy algorithm
- Polyhedral properties for the intersection of two knapsacks
- On \(f\)-domination: polyhedral and algorithmic results
- 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
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Solving the generalised assignment problem using polyhedral results
- A combinatorial optimization approach to the selection of statistical units
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- 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
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- 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
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
- A polyhedral approach to sequence alignment problems
- 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
- A note on the knapsack problem with special ordered sets
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- The submodular knapsack polytope
- Cutting planes in integer and mixed integer programming
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- On facets of knapsack equality polytopes
- A polyhedral study of the semi-continuous knapsack problem
- Foundation-penalty cuts for mixed-integer programs.
- Requiring connectivity in the set covering problem
- A polyhedral study of dynamic monopolies
- Faces for a linear inequality in 0–1 variables
- Supermodular covering knapsack polytope
- Maximizing a class of submodular utility functions
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Adjacency of the 0-1 knapsack problem
- (1,k)-configurations and facets for packing problems
- Lifting the facets of zero–one polytopes
This page was built for publication: Facet of regular 0–1 polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074672)
