Lifting two-integer knapsack inequalities

DOI10.1007/S10107-006-0705-9zbMATH Open1278.90453OpenAlexW1981753132WikidataQ57736611 ScholiaQ57736611MaRDI QIDQ868448FDOQ868448

Authors: Agostinho Agra, Miguel Constantino 

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

Recommendations

• Lifting the knapsack cover inequalities for the knapsack polytope
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• scientific article; zbMATH DE number 2086920
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Lifted inequalities for 0-1 mixed integer programming: superlinear lifting

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Hybrid heuristics for a short sea inventory routing problem
• Integer programming solution approach for inventory‐production–distribution problems with direct shipments
• Lifting for the integer knapsack cover polyhedron
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
• Simple lifted cover inequalities and hard knapsack problems
• Mixing MIR inequalities with two divisible coefficients
• Theoretical challenges towards cutting-plane selection
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Description of 2-integer continuous knapsack polyhedra
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• Two-set inequalities for the binary knapsack polyhedra
• Intersection cuts for single row corner relaxations
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868448)