The directional \(p\)-median problem: definition, complexity, and algorithms
type: Item
instance of: scholarly article
title: The directional \(p\)-median problem: definition, complexity, and algorithms
zbMATH Open document ID: 1163.90404
author: Laura E. Jackson
author: George N. Rouskas
author: Matthias F. M. Stallmann
published in: European Journal of Operational Research
publication date: 2007-02-12T00:00:00Z
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5124551
zbMATH Keywords: directional \(p\)-median problem
zbMATH Keywords: traffic quantization
zbMATH Keywords: vector quantization
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.06.080
OpenAlex ID: W2107175859
cites work: Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
cites work: Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
cites work: Proportionate progress: A notion of fairness in resource allocation
cites work: Q4857376
cites work: Improved complexity bounds for location problems on the real line
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: Facility siting and integer-friendly programming
cites work: Heuristic concentration: Two stage solution construction
cites work: Network distance characteristics that affect computational effort in \(p\)-median location problems
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: The shortest route problem with constraints
DOI: 10.1016/J.EJOR.2005.06.080
Recommended article: A computational study for the \(p\)-median problem
Recommended article: Q3358523
Recommended article: Q4229616
Recommended article: A tighter formulation of the \(p\)-median problem
Recommended article: Q4779149
Recommended article: Q3691386
Recommended article: Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
Recommended article: Computational study of large-scale \(p\)-median problems
Recommended article: An approximation algorithm for the \(p\)-hub median problem
Recommended article: A dynamic programming heuristic for the \(P\)-median problem
description: scientific article; zbMATH DE number 5124551