Allocating servers to facilities, when demand is elastic to travel and waiting times
From MaRDI portal
Publication:5479858
DOI10.1051/ro:2006002zbMath1103.90059OpenAlexW2064302519MaRDI QIDQ5479858
Francisco Javier Barros, Miguel Ríos, Vladimir Marianov
Publication date: 11 July 2006
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_3_143_0
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (6)
A review of congestion models in the location of facilities with immobile servers ⋮ The profit-oriented hub line location problem with elastic demand ⋮ The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue ⋮ Facility location for market capture when users rank facilities by shorter travel and waiting times ⋮ Medical facility network design: user-choice and system-optimal models ⋮ Deterministic state-based information disclosure policies and social welfare maximization in strategic queueing systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
- Location-allocation on congested networks
- Heuristic concentration: Two stage solution construction
- Location of multiple-server congestible facilities for maximizing expected demand, when services are non-essential
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- A gamma heuristic for the \(p\)-median problem
- Location-allocation of multiple-server service centers with constrained queues or waiting times
- The Stochastic Queue p-Median Problem
- The Standard Response Fire Protection Siting Problem
- Optimal 2-Facility Network Districting in the Presence of Queuing
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Exact Solution to a Location Problem with Stochastic Demands
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Allocating servers to facilities, when demand is elastic to travel and waiting times
