Facet of regular 0–1 polytopes
From MaRDI portal
Publication:4074672
DOI10.1007/BF01580442zbMath0314.90064OpenAlexW1967535666MaRDI QIDQ4074672
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
Related Items (96)
Implicit cover inequalities ⋮ The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ Knapsack polytopes: a survey ⋮ On the complexity of sequentially lifting cover inequalities for the knapsack polytope ⋮ A polyhedral investigation of star colorings ⋮ On the mixing set with a knapsack constraint ⋮ Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem ⋮ Approximate Deadline-Scheduling with Precedence Constraints ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints ⋮ Polyhedral analysis for concentrator location problems ⋮ Facets of the knapsack polytope derived from disjoint and overlapping index configurations ⋮ Theoretical challenges towards cutting-plane selection ⋮ Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems ⋮ Exploiting nested inequalities and surrogate constraints ⋮ On facets of knapsack equality polytopes ⋮ Time-tables, polyhedra and the greedy algorithm ⋮ Ordered matroids and regular independence systems ⋮ On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) ⋮ On cutting-plane proofs in combinatorial optimization ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Polytopes associated with symmetry handling ⋮ Integer programming solution approach for inventory‐production–distribution problems with direct shipments ⋮ A note on the implications of approximate submodularity in discrete optimization ⋮ Sequence independent lifting for mixed knapsack problems with GUB constraints ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ Facet defining inequalities for the dichotomous knapsack problem ⋮ Polyhedral approaches to learning Bayesian networks ⋮ A note on the knapsack problem with special ordered sets ⋮ Faces for a linear inequality in 0–1 variables ⋮ Multidimensional sum-up rounding for integer programming in optimal experimental design ⋮ Second-order cover inequalities ⋮ The mixing-MIR set with divisible capacities ⋮ Branch-and-cut for complementarity-constrained optimization ⋮ The maximum \(k\)-colorable subgraph problem and orbitopes ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities ⋮ Adjacency of the 0-1 knapsack problem ⋮ Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ Supermodular covering knapsack polytope ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ On tightening cover induced inequalities ⋮ The complexity of lifted inequalities for the knapsack problem ⋮ Polyhedral properties for the intersection of two knapsacks ⋮ Lineare Charakterisierungen von Travelling Salesman Problemen ⋮ On the completability of incomplete Latin squares ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ Polyhedral results for the precedence-constrained knapsack problem ⋮ Cutting planes in integer and mixed integer programming ⋮ Maximizing a class of submodular utility functions ⋮ A new extended formulation of the generalized assignment problem and some associated valid inequalities ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ A branch and cut algorithm for hub location problems with single assignment ⋮ A class of facet producing graphs for vertex packing polyhedra ⋮ Requiring connectivity in the set covering problem ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ Lifting the facets of zero–one polytopes ⋮ 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 ⋮ (1,k)-configurations and facets for packing problems ⋮ Mathematical programming approaches for generating \(p\)-efficient points ⋮ A polyhedral study of dynamic monopolies ⋮ Optimization algorithms for the disjunctively constrained knapsack problem ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ A note on the continuous mixing set ⋮ Idealness and 2-resistant sets ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ RENS. The optimal rounding ⋮ A combinatorial optimization approach to the selection of statistical units ⋮ An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. ⋮ Polyhedral techniques in combinatorial optimization I: Theory ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets ⋮ On Latin squares and the facial structure of related polytopes ⋮ Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Valid inequalities, cutting planes and integrality of the knapsack polytope ⋮ Optimum Solution of the Closest String Problem via Rank Distance ⋮ Unnamed Item ⋮ The submodular knapsack polytope ⋮ Regular (2, 2)-systems ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ Solving the generalised assignment problem using polyhedral results ⋮ A polyhedral approach to sequence alignment problems ⋮ Approximation algorithms for covering/packing integer programs ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Some integer programs arising in the design of main frame computers ⋮ Computing low-capacity 0–1 knapsack polytopes ⋮ Cover and pack inequalities for (mixed) integer programming ⋮ Integer-programming software systems
Cites Work
This page was built for publication: Facet of regular 0–1 polytopes
