Multidimensional approximation algorithms for capacity-expansion problems

DOI10.1287/OPRE.1100.0892zbMATH Open1228.90161OpenAlexW2072165001MaRDI QIDQ3098756FDOQ3098756

Authors: Van Anh Truong, Robin Roundy 

Publication date: 18 November 2011

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

Full work available at URL: https://semanticscholar.org/paper/df7748a19ab458dcf812580161b917b03dd48322

Recommendations

• Capacity expansion planning for a single facility product line
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• Stochastic capacity expansion with multiple sources of capacity

zbMATH Keywords

dynamic programminganalysis of algorithmscapacity expansionfacilities planningequipment planning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Dynamic programming (90C39)

Cited In (3)

• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales
• New Bounds on the Capacity of Multidimensional Run-Length Constraints

This page was built for publication: Multidimensional approximation algorithms for capacity-expansion problems

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