The stochastic location-assignment problem on a tree
From MaRDI portal
Publication:816410
DOI10.1007/s10479-005-2040-6zbMath1114.90065OpenAlexW2075041492MaRDI QIDQ816410
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2040-6
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)
Related Items
A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty, Stochastic location-assignment on an interval with sequential arrivals
Cites Work
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Production and location on a network under demand uncertainty
- Determining efficient facility locations on a tree network operating as a FIFOM/G/1 queue
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Locating a Mobile Server Queueing Facility on a Tree Network
- Solving stochastic programs with network recourse
- A single-server priority queueing-location model
- An Overview of Representative Problems in Location Research
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Based Procedure for Stochastic Facility Location
- Exact Solution to a Location Problem with Stochastic Demands
- Introduction to Stochastic Programming
- A Unified Family of Single-Server Queueing Location Models
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
