A Method of Decomposition for Integer Programs

DOI10.1287/opre.27.6.1128zbMath0442.90063OpenAlexW2052336185MaRDI QIDQ3885521

Dennis J. Sweeney, Richard A. Murphy

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.6.1128

zbMATH Keywords

Lagrangian relaxationdecomposition methodcomputational resultsblock angular structureoptimality theorem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (14)

All-integer column generation for set partitioning: basic principles and extensions ⋮ Coordinating decentralized linear programs by exchange of primal information ⋮ An integer optimality condition for column generation on zero-one linear programs ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ A decomposition approach for facility location and relocation problem with uncertain number of future facilities ⋮ A heuristic decomposition approach to optimal control in a water supply model ⋮ Optimal control of system with continuous and discrete state variables ⋮ Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation ⋮ A decomposition technique for mixed integer programming problems ⋮ A method for decomposing mixed-integer linear programs with staircase structure ⋮ A method for decomposing mixed-integer linear programming problems with angular structure ⋮ Cross decomposition for mixed integer programming ⋮ A decomposition approach to multi-project scheduling ⋮ On compact formulations for integer programs solved by column generation

This page was built for publication: A Method of Decomposition for Integer Programs