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

DOI10.1016/J.EJOR.2005.06.080MaRDI QIDQ864030zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A computational study for the \(p\)-median problem
• scientific article; zbMATH DE number 4209907
• scientific article; zbMATH DE number 1253050
• A tighter formulation of the p-median problem
• scientific article; zbMATH DE number 1834653
• scientific article; zbMATH DE number 3915986
• Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
• Computational study of large-scale \(p\)-median problems
• An approximation algorithm for the \(p\)-hub median problem
• A dynamic programming heuristic for the \(P\)-median problem

Cites work

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

Cited in

(5)

• Ant colony optimization for finding medians of weighted graphs
• Computational study of large-scale \(p\)-median problems
• Multi-facility ordered median problems in directed networks
• Using dual feasible functions to construct fast lower bounds for routing and location problems
• An algorithm for the 2-median problem on two-dimensional meshes

Describes a project that uses

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

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

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