The p-maxian problem on a tree

DOI10.1016/J.ORL.2006.03.016MaRDI QIDQ2467473zbMATH OpenOpenAlexFDO

Authors Jafar Fathali, Rainer E. Burkard, Hossein Taghizadeh Kakhki

Publication date 21 January 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.03.016

zbMATH Keywords

\(p\)-median problemobnoxious facilities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• The balanced 2-median and 2-maxian problems on a tree
• The \(p\)-maxian problem on block graphs
• The obnoxious center problem on a tree
• scientific article; zbMATH DE number 4209907
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 3328106 (Why is no real title available?)
• 2-medians in trees with pos/neg weights
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
• Discrete location problems with push-pull objectives
• Obnoxious Facility Location on Graphs

Cited in

(23)

• The backup 2-median problem on block graphs
• The \(p\)-Maxian problem on interval graphs
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• The \(p\)-maxian problem on block graphs
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs
• The balanced 2-median and 2-maxian problems on a tree
• Inverse quickest center location problem on a tree
• Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• A modified optimal algorithm for 2-Maxian location problems on cactus graphs
• The 2-maxian problem on cactus graphs
• A strongly polynomial time algorithm for the maximum supply rate problem on trees
• A strongly polynomial time algorithm for the maximum supply rate problem on trees
• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
• Median problems with positive and negative weights on cycles and cacti
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• The obnoxious facilities p-center problem with forbidden regions
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• An variation for one souslin tree
• Maximal flow in branching trees and binary search trees
• The Maximum Binary Tree Problem.
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks

This page was built for publication: The \(p\)-maxian problem on a tree

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