Location on Tree Networks: P-Centre and n-Dispersion Problems
From MaRDI portal
Publication:3960445
DOI10.1287/moor.6.1.50zbMath0496.90032OpenAlexW2015067965MaRDI QIDQ3960445
Andrew F. Daughety, R. Chandrasekaran
Publication date: 1981
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.6.1.50
Related Items
Lexbfs-orderings and powers of hhd-free graphs∗, Powers of hhd-free graphs∗, A finite algorithm for the continuousp-center location problem on a graph, Analytical models for locating undesirable facilities, Facility location on a tree with maximum distance constraints, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Review of obnoxious facilities location problems, A review on discrete diversity and dispersion maximization from an OR perspective, Vertex fusion under diameter constraints, Formulations and valid inequalities for the capacitated dispersion problem, The discrete p-dispersion problem, Locational analysis, Effective metaheuristic algorithms for the minimum differential dispersion problem, A new compact formulation for the discrete \(p\)-dispersion problem, Good solutions to discrete noxious location problems via metaheuristics, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Confined location of facilities on a graph, Measuring diversity. A review and an empirical analysis, Augmenting forests to meet odd diameter requirements, Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs, Center location problems on tree graphs with subtree-shaped customers, A heuristic approach for the max-min diversity problem based on max-clique, Improved approximability and non-approximability results for graph diameter decreasing problems, The discrete p-maxian location problem, Continuous bottleneck tree partitioning problems, GRASP and path relinking for the max-min diversity problem, Vertex fusion under distance constraints, Some personal views on the current state and the future of locational analysis, The Location of Undesirable Facilities, Polynomially bounded algorithms for locatingp-centers on a tree
