Tailoring Benders decomposition for uncapacitated network design
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 112-154
- https://doi.org/10.1007/bfb0121090
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Strong Formulations for Multi-Item Capacitated Lot SizingManagement Science, 1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Solving the optimal network problemEuropean Journal of Operational Research, 1979
- IntroductionTransportation Research Part B: Methodological, 1979
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- Network Design with Fixed and Variable Cost ElementsTransportation Science, 1973
- An integer programming approach to a class of combinatorial problemsMathematical Programming, 1972