Stochastic location-assignment on an interval with sequential arrivals
From MaRDI portal
Publication:993467
DOI10.1007/S11067-010-9137-4zbMATH Open1194.90043OpenAlexW2031800284MaRDI QIDQ993467FDOQ993467
Publication date: 20 September 2010
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-010-9137-4
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Location-Allocation Problems
- Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
- Title not available (Why is that?)
- Minimizing a Submodular Function on a Lattice
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- A Sequential Stochastic Assignment Problem
- Optimal positioning of a mobile service unit on a line
- A note on the optimal positioning of service units
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- A Patrol Problem
- Optimal Positioning of Service Units Along a Coordinate Line
- Robust Positioning of Service Units
- Title not available (Why is that?)
- Multistage system planning for hydrogen production and distribution
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- The stochastic location-assignment problem on a tree
- Capacitated, balanced, sequential location-allocation problems on chains and trees
- Police patrol policies on motorways with unequal patrol lengths
Cited In (1)
Recommendations
This page was built for publication: Stochastic location-assignment on an interval with sequential arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993467)
