Description of 2-integer continuous knapsack polyhedra

DOI10.1016/J.DISOPT.2005.10.008MaRDI QIDQ2506817zbMATH OpenOpenAlexWikidataFDO

Authors Agostinho Agra, Miguel Constantino

Publication date 10 October 2006

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.10.008

zbMATH Keywords

mixed integer programmingpolyhedral characterizationsingle node flow problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• On the multiple integer knapsack polyhedra
• On the facets of the mixed-integer knapsack polyhedron
• Lifting two-integer knapsack inequalities
• The continuous knapsack set
• A compact formulation of a mixed-integer set

Cites work

• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A polyhedral approach to a production planning problem
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Capacitated Network Design—Polyhedral Structure and Computation
• Hilbert Bases and the Facets of Special Knapsack Polytopes
• Mixing mixed-integer inequalities
• On the dimension of projected polyhedra
• The 0-1 knapsack problem with a single continuous variable
• Twistor spaces and harmonic maps

Cited in

(17)

• A compact formulation of a mixed-integer set
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• Mixed-integer sets from two rows of two adjacent simplex bases
• On the multiple integer knapsack polyhedra
• The Integer Knapsack Cover Polyhedron
• Discretized formulations for capacitated location problems with modular distribution costs
• Polyhedral properties for the intersection of two knapsacks
• Valid inequalities based on simple mixed-integer sets
• On the facets of mixed integer programs with two integer variables and two constraints
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• Mixing MIR inequalities with two divisible coefficients
• Lifting two-integer knapsack inequalities
• Intersection cuts for single row corner relaxations
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Polyhedral description of the integer single node flow set with constant bounds
• Continuous knapsack sets with divisible capacities
• The continuous knapsack set

This page was built for publication: Description of 2-integer continuous knapsack polyhedra

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