Locating Discretionary Service Facilities Based on Probabilistic Customer Flows

DOI10.1287/trsc.29.3.276zbMath0858.90085OpenAlexW2089694868MaRDI QIDQ4897091

Dmitry Krass, Oded Berman, Chen Wei Xu

Publication date: 3 December 1996

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.3.276

zbMATH Keywords

greedy heuristic algorithmlocating discretionary facilities on a network

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Markov and semi-Markov decision processes (90C40) Discrete location and assignment (90B80)

Related Items (6)

Locating flow-intercepting facilities: New approaches and results ⋮ Combinatorial aspects of the sensor location problem ⋮ Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem ⋮ Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada ⋮ Locating flow-capturing units on a network with multi-counting and diminishing returns to scale ⋮ Solving the competitive discretionary service facility location problem

This page was built for publication: Locating Discretionary Service Facilities Based on Probabilistic Customer Flows