Two-set inequalities for the binary knapsack polyhedra

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

Unnamed Item
Unnamed Item
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
Cutting planes in integer and mixed integer programming
Knapsack polytopes: a survey
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
A multi-level search strategy for the 0-1 multidimensional knapsack problem
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
On tightening cover induced inequalities
A genetic algorithm for the multidimensional knapsack problem
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
A fuzzy DEA and knapsack formulation integrated model for project selection
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Sequence independent lifting in mixed integer programming
Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
On lifted cover inequalities: a new lifting procedure with unusual properties
Production and inventory management under multiple resource constraints
Some polyhedra related to combinatorial problems
Simple lifted cover inequalities and hard knapsack problems
Merging valid inequalities over the multiple knapsack polyhedron
Separation algorithms for 0-1 knapsack polytopes
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Easily Computable Facets of the Knapsack Polytope
A global optimization approach for solving three-dimensional open dimension rectangular packing problems
A Knapsack Secretary Problem with Applications
Lifting the facets of zero–one polytopes
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
Technical Note—A Note on Zero-One Programming
Faces for a linear inequality in 0–1 variables
Facets of the knapsack polytope
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Facets of the Knapsack Polytope From Minimal Covers
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
Reducibility among Combinatorial Problems
Approximate and exact merging of knapsack constraints with cover inequalities

This page was built for publication: Two-set inequalities for the binary knapsack polyhedra