A unified approach for price directive decomposition procedures in integer programming

DOI10.1016/0166-218X(88)90077-7zbMath0655.90051OpenAlexW2014220159MaRDI QIDQ1109677

Jørgen Tind, Søren Holm

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90077-7

zbMATH Keywords

branch and boundcutting planesuperadditive dualityblockangular structureDantzig-Wolfe decomposition principlepolyhedral constraint set

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items

Decomposition in global optimization ⋮ On compact formulations for integer programs solved by column generation

Cites Work

• Cutting-plane theory: Algebraic methods
• Integer Programming and Pricing
• The Decomposition Algorithm for Linear Programs
• On general decomposition schemes in mathematical programming
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified approach for price directive decomposition procedures in integer programming