Sequential location-allocation problems on chains and trees with probabilistic link demands
From MaRDI portal
Publication:3686391
DOI10.1007/BF01582049zbMath0569.90019MaRDI QIDQ3686391
Hanif D. Sherali, Tom M. Cavalier
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
chain graphtree graphsp-mediandynamic locationsequential location-allocationmyopic strategylong-range strategymultiperiod minisum location problems on networksprobabilistic link demands
Related Items (6)
Capacitated, balanced, sequential location-allocation problems on chains and trees ⋮ On covering location problems on networks with edge demand ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ A generalized two-agent location problem: Asymmetric dynamics and coordination ⋮ On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems ⋮ Stochastic location-assignment on an interval with sequential arrivals
Cites Work
- Unnamed Item
- The minisum location problem on an undirected network with continuous link demands
- Timing market entry with a contribution-maximization approach to location-allocation decisions
- A comparative study of approaches to dynamic location problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Multiregion Dynamic Capacity Expansion Problem, Part I
- The Multiregion Dynamic Capacity Expansion Problem, Part II
- A Dual-Based Procedure for Dynamic Facility Location
- An Improved Long-Run Model for Multiple Warehouse Location
- Multilocation Plant Sizing and Timing
- Stochastic Dynamic Location Analysis
- The Centers and Medians of a Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Sequential location-allocation problems on chains and trees with probabilistic link demands
