Sequence independent lifting for mixed knapsack problems with GUB constraints
type: Item
instance of: scholarly article
title: Sequence independent lifting for mixed knapsack problems with GUB constraints
zbMATH Open document ID: 1327.90123
author: A. Angulo
author: Rodrigo Palma
author: Daniel G. Espinoza
published in: Mathematical Programming. Series A. Series B
publication date: 2015-12-09T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/148014
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 6518233
zbMATH Keywords: knapsack problem
zbMATH Keywords: sequence-independent multidimensional lifting
zbMATH Keywords: generalized upper bounds
MaRDI profile type: Publication
OpenAlex ID: W2030982114
cites work: Q4339078
cites work: Sequence Independent Lifting for Mixed-Integer Programming
cites work: Facets of the knapsack polytope
cites work: Canonical Cuts on the Unit Hypercube
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Benchmarking optimization software with performance profiles.
cites work: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Sequence independent lifting in mixed integer programming
cites work: Facet of regular 0–1 polytopes
cites work: The complexity of lifted inequalities for the knapsack problem
cites work: A note on the knapsack problem with special ordered sets
cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
cites work: Q4040221
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: (1,k)-configurations and facets for packing problems
cites work: Valid inequalities for mixed 0-1 programs
cites work: Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
cites work: Faces for a linear inequality in 0–1 variables
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
cites work: Lifting the facets of zero–one polytopes
cites work: A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
DOI: 10.1007/S10107-015-0902-5
description: scientific article; zbMATH DE number 6518233