Stochastic last mile relief network design with resource reallocation
DOI10.1007/s00291-017-0498-7zbMath1390.90117OpenAlexW2712778292MaRDI QIDQ1703464
Nilay Noyan, Gökçe Kahvecioğlu
Publication date: 2 March 2018
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: http://research.sabanciuniv.edu/32426/1/GokceKahveciogluAskin_10049830.pdf
accessibilitystochastic programmingdecompositionfacility locationequitybranch-and-cutHumanitarian logisticsL-shapedinventory reallocationrelief network design
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A math-heuristic for the warehouse location-routing problem in disaster relief
- Pre-positioning planning for emergency response with service quality constraints
- Inventory relocation for overlapping disaster settings in humanitarian operations
- A multi-criteria optimization model for humanitarian aid distribution
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A dynamic logistics coordination model for evacuation and support in disaster response activities
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Stochastic integer programming: general models and algorithms
- Equity measurement in facility location analysis: A review and framework
- The Benders decomposition algorithm: a literature review
- A two-echelon stochastic facility location model for humanitarian relief logistics
- Risk-averse two-stage stochastic programming with an application to disaster management
- The bi-objective stochastic covering tour problem
- Alternate risk measures for emergency medical service system design
- OR/MS research in disaster operations management
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Improving the Integer L-Shaped Method
- Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs
- A model to assess risk, equity and efficiency in facility location and transportation of hazardous materials
- Introduction to Stochastic Programming
- Two‐stage stochastic integer programming: a survey
- A two-stage stochastic programming framework for transportation planning in disaster response
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
This page was built for publication: Stochastic last mile relief network design with resource reallocation