An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
From MaRDI portal
Publication:3580158
DOI10.1002/nav.20401zbMath1205.90181OpenAlexW2105100227MaRDI QIDQ3580158
John Penuel, J. Cole Smith, Yang Yuan
Publication date: 11 August 2010
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20401
Related Items (4)
A decomposition approach for solving a broadcast domination network design problem ⋮ An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs ⋮ Effective location models for sorting recyclables in public management ⋮ Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
Cites Work
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Partitioning procedures for solving mixed-variables programming problems
- Stochastic programming with simple integer recourse
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Linear Programming under Uncertainty
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- The Vehicle Routing Problem with Stochastic Travel Times
- Exact Solution to a Location Problem with Stochastic Demands
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Stochastic Programs with Recourse
This page was built for publication: An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
