Sequence independent lifting for mixed knapsack problems with GUB constraints
From MaRDI portal
Publication:896279
DOI10.1007/s10107-015-0902-5zbMath1327.90123OpenAlexW2030982114MaRDI QIDQ896279
Alejandro Angulo, Rodrigo Palma, Daniel G. Espinoza
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/148014
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Sequence Independent Lifting for the Set of Submodular Maximization Problem ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Sequence independent lifting for a set of submodular maximization problems
Cites Work
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Valid inequalities for mixed 0-1 programs
- A note on the knapsack problem with special ordered sets
- The complexity of lifted inequalities for the knapsack problem
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Sequence independent lifting in mixed integer programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Sequence Independent Lifting for Mixed-Integer Programming
- Valid Linear Inequalities for Fixed Charge Problems
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
- Canonical Cuts on the Unit Hypercube
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
