The directional \(p\)-median problem: definition, complexity, and algorithms

DOI10.1016/j.ejor.2005.06.080zbMath1163.90404OpenAlexW2107175859MaRDI QIDQ864030

George N. Rouskas, Matthias F. M. Stallmann, Laura E. Jackson

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.080

zbMATH Keywords

vector quantizationdirectional \(p\)-median problemtraffic quantization

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (2)

Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ Ant colony optimization for finding medians of weighted graphs

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Improved complexity bounds for location problems on the real line
• Facility siting and integer-friendly programming
• Heuristic concentration: Two stage solution construction
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• Network distance characteristics that affect computational effort in \(p\)-median location problems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• The shortest route problem with constraints
• On the Complexity of Some Common Geometric Location Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: The directional \(p\)-median problem: definition, complexity, and algorithms