Lifting two-integer knapsack inequalities

DOI10.1007/s10107-006-0705-9zbMath1278.90453OpenAlexW1981753132WikidataQ57736611 ScholiaQ57736611MaRDI QIDQ868448

Miguel Fragoso Constantino, Agostinho Agra

Publication date: 5 March 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0705-9

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (10)

Intersection cuts for single row corner relaxations ⋮ Theoretical challenges towards cutting-plane selection ⋮ Cascading knapsack inequalities: reformulation of a crude oil distribution problem ⋮ Integer programming solution approach for inventory‐production–distribution problems with direct shipments ⋮ Lifting for the integer knapsack cover polyhedron ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ Mixing MIR inequalities with two divisible coefficients ⋮ Hybrid heuristics for a short sea inventory routing problem ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs

Cites Work

• Unnamed Item
• Unnamed Item
• The 0-1 knapsack problem with a single continuous variable
• On the facets of the mixed-integer knapsack polyhedron
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• On capacitated network design cut-set polyhedra
• Sequence independent lifting in mixed integer programming
• Description of 2-integer continuous knapsack polyhedra
• Some polyhedra related to combinatorial problems
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Sequence Independent Lifting for Mixed-Integer Programming
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• Hilbert Bases and the Facets of Special Knapsack Polytopes
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Flow pack facets of the single node fixed-charge flow polytope

This page was built for publication: Lifting two-integer knapsack inequalities