The obnoxious center problem on a tree

DOI10.1137/S0895480198340967MaRDI QIDQ2753540zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Helidon Dollani, Günter Rote, Yixun Lin

Publication date 11 November 2001

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480198340967

zbMATH Keywords

center problemlinear-time algorithmlocation problemsobnoxious facilities

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Discrete location and assignment (90B80) Continuous location (90B85) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The obnoxious center problem on weighted cactus graphs.
• scientific article; zbMATH DE number 1538875
• Obnoxious Centers in Graphs
• Obnoxious centers in graphs
• Reverse selective obnoxious center location problems on tree graphs

Cited in

(11)

• The obnoxious center problem on weighted cactus graphs.
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Center problems with pos/neg weights on trees
• Efficient algorithms for center problems in cactus networks
• The p-maxian problem on a tree
• Axiomatization and the antimean function on paths
• Obnoxious centers in graphs
• scientific article; zbMATH DE number 1538875 (Why is no real title available?)
• Memetic algorithm for the antibandwidth maximization problem
• The obnoxious facilities p-center problem with forbidden regions
• A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization

This page was built for publication: The obnoxious center problem on a tree

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