Sequential location-allocation problems on chains and trees with probabilistic link demands

DOI10.1007/BF01582049MaRDI QIDQ3686391zbMATH OpenFDO

Authors Tom M. Cavalier, Hanif D. Sherali

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01582049

zbMATH Keywords

chain graphtree graphsp-mediandynamic locationsequential location-allocationmyopic strategylong-range strategymultiperiod minisum location problems on networksprobabilistic link demands

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Recommendations

• Capacitated, balanced, sequential location-allocation problems on chains and trees
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• The minisum location problem on an undirected network with continuous link demands
• Optimal M/G/1 server location on a tree network with continuous link demands
• The stochastic location-assignment problem on a tree

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• A Dual-Based Procedure for Dynamic Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• A comparative study of approaches to dynamic location problems
• An Improved Long-Run Model for Multiple Warehouse Location
• Multilocation Plant Sizing and Timing
• 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
• Stochastic Dynamic Location Analysis
• The Centers and Medians of a Graph
• The Multiregion Dynamic Capacity Expansion Problem, Part I
• The Multiregion Dynamic Capacity Expansion Problem, Part II
• The minisum location problem on an undirected network with continuous link demands
• Timing market entry with a contribution-maximization approach to location-allocation decisions

Cited in

(11)

• A generalized two-agent location problem: Asymmetric dynamics and coordination
• The stochastic location-assignment problem on a tree
• On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
• Stochastic location-assignment on an interval with sequential arrivals
• A dynamic location problem for graphs
• Dynamic location of modular manufacturing facilities with relocation of individual modules
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• On covering location problems on networks with edge demand
• Capacitated, balanced, sequential location-allocation problems on chains and trees
• Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree

This page was built for publication: Sequential location-allocation problems on chains and trees with probabilistic link demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686391)