The directional p-median problem: definition, complexity, and algorithms
From MaRDI portal
Publication:864030
DOI10.1016/J.EJOR.2005.06.080zbMATH Open1163.90404OpenAlexW2107175859MaRDI QIDQ864030FDOQ864030
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
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
- Title not available (Why is that?)
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Proportionate progress: A notion of fairness in resource allocation
- On the Complexity of Some Common Geometric Location Problems
- The shortest route problem with constraints
- Improved complexity bounds for location problems on the real line
- Facility siting and integer-friendly programming
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- Heuristic concentration: Two stage solution construction
- Network distance characteristics that affect computational effort in \(p\)-median location problems
Cited In (5)
- Computational study of large-scale \(p\)-median problems
- Multi-facility ordered median problems in directed networks
- Ant colony optimization for finding medians of weighted graphs
- 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
Uses Software
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)
