Lifting two-integer knapsack inequalities
type: Item
instance of: scholarly article
title: Lifting two-integer knapsack inequalities
zbMATH Open document ID: 1278.90453
published in: Mathematical Programming. Series A. Series B
publication date: 2007-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5131062
author: Agostinho Agra
author: Miguel Constantino
MaRDI profile type: Publication
full work available at URL: s10107-006-0705-9
OpenAlex ID: W1981753132
Wikidata QID: Q57736611
cites work: Description of 2-integer continuous knapsack polyhedra
cites work: Q5477436
cites work: Flow pack facets of the single node fixed-charge flow polytope
cites work: On capacitated network design cut-set polyhedra
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: Sequence Independent Lifting for Mixed-Integer Programming
cites work: Some polyhedra related to combinatorial problems
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Sequence independent lifting in mixed integer programming
cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
cites work: The 0-1 knapsack problem with a single continuous variable
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Q4040221
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
cites work: Hilbert Bases and the Facets of Special Knapsack Polytopes
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
DOI: 10.1007/S10107-006-0705-9
description: scientific article; zbMATH DE number 5131062