Sequence independent lifting for mixed knapsack problems with GUB constraints
DOI10.1007/S10107-015-0902-5zbMATH Open1327.90123OpenAlexW2030982114MaRDI QIDQ896279FDOQ896279
Authors: A. 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
Recommendations
- Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- A polyhedral study of the semi-continuous knapsack problem
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Sequence independent lifting in mixed integer programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- 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
- Title not available (Why is that?)
- Canonical Cuts on the Unit Hypercube
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Sequence Independent Lifting for Mixed-Integer Programming
- Valid inequalities for mixed 0-1 programs
- A note on the knapsack problem with special ordered sets
- Valid Linear Inequalities for Fixed Charge Problems
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- The complexity of lifted inequalities for the knapsack problem
Cited In (5)
- Sequence independent lifting for a set of submodular maximization problems
- Lifting for the integer knapsack cover polyhedron
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints
This page was built for publication: Sequence independent lifting for mixed knapsack problems with GUB constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896279)
