The p-maxian problem on a tree

Authors:
Rainer E. Burkard;Jafar Fathali;Hossein Taghizadeh Kakhki
Affiliations:
Graz University of Technology, Institute of Optimization and Discrete Mathematics, Steyrergasse 30, A-8010 Graz, Austria;Department of Mathematics, Shahrood University of Technology, University Blvd., Shahrood, Iran;Department of Mathematics, Ferdowsi University of Mashhad, Vakil Abad Blvd., Mashhad, 91775-1159, Iran
Venue:
Operations Research Letters
Year:
2007

Citing 4
Cited 1

Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
2-medians in trees with pos/neg weights

Discrete Applied Mathematics
Discrete location problems with push-pull objectives

Discrete Applied Mathematics

The p-maxian problem on interval graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the leaves of a longest path provide an optimal solution for the 2-maxian problem (and the p-maxian problem, p=3) on a tree. In a second model for obnoxious p-median problems on trees it turns out that the p-median may not contain any leaves at all.