Technical Note—A Note on Zero-One Programming

Cited in

(68)

Path planning for unmanned vehicles with localization constraints
Classical cuts for mixed-integer programming and branch-and-cut
Polyhedral results for the precedence-constrained knapsack problem
(1,k)-configuration facets for the generalized assignment problem
Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
Lifting the knapsack cover inequalities for the knapsack polytope
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Valid inequalities, cutting planes and integrality of the knapsack polytope
A new lifting theorem for vertex packing
A branch-and-cut algorithm for the median-path problem
The complexity of lifted inequalities for the knapsack problem
Valid inequalities for quadratic optimisation with domain constraints
New facets for the two-stage uncapacitated facility location polytope
A concurrent processing framework for the set partitioning problem
On ternary problems
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
Lifting convex inequalities for bipartite bilinear programs
Lifting convex inequalities for bipartite bilinear programs
On tightening cover induced inequalities
A generalization of antiwebs to independence systems and their canonical facets
A hybrid algorithm for the generalized assignment problem
Generalized cover facet inequalities for the generalized assignment problem
On cutting-plane proofs in combinatorial optimization
A class of facet producing graphs for vertex packing polyhedra
\(O(n \log n)\) procedures for tightening cover inequalities
On the complexity of separating cutting planes for the knapsack polytope
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Efficient reformulation for 0-1 programs -- methods and computational results
A note on the generalized Steiner tree polytope
Bidirected and unidirected capacity installation in telecommunication networks.
Facet defining inequalities for the dichotomous knapsack problem
Polyhedral properties of the induced cluster subgraphs
On lifted cover inequalities: a new lifting procedure with unusual properties
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
The Boolean quadratic polytope: Some characteristics, facets and relatives
On the complexity of separation from the knapsack polytope
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
Lifting for conic mixed-integer programming
Cover and pack inequalities for (mixed) integer programming
Lineare Charakterisierungen von Travelling Salesman Problemen
Lexicographical order in integer programming
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
Airline crew scheduling: state-of-the-art
The quadratic knapsack problem -- a survey
A note on the knapsack problem with special ordered sets
Solving the asymmetric traveling purchaser problem
Facets of the knapsack polytope derived from disjoint and overlapping index configurations
Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
Cutting planes in integer and mixed integer programming
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Valid inequalities for the -edge disruptor problem
Risk-averse shortest path interdiction
A note on node packing polytopes on hypergraphs
The project scheduling polyhedron: Dimension, facets and lifting theorems
Two-set inequalities for the binary knapsack polyhedra
Facets of the knapsack polytope
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
On the facets of the simple plant location packing polytope
Chance-Constrained Binary Packing Problems
New facets for the set packing polytope
(1,k)-configurations and facets for packing problems
Lifting the facets of zero–one polytopes

This page was built for publication: Technical Note—A Note on Zero-One Programming

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