Location on Tree Networks: P-Centre and n-Dispersion Problems

DOI10.1287/MOOR.6.1.50MaRDI QIDQ3960445zbMATH OpenOpenAlexFDO

Authors R. Chandrasekaran, Andrew F. Daughety

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

zbMATH Keywords

logisticspolynomial algorithmsfacility location on treesn-dispersionP-centre

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)

Cited in

(31)

• Vertex fusion under distance constraints
• A review on discrete diversity and dispersion maximization from an OR perspective
• The discrete p-dispersion problem
• A new compact formulation for the discrete \(p\)-dispersion problem
• A finite algorithm for the continuousp-center location problem on a graph
• Augmenting forests to meet odd diameter requirements
• Analytical models for locating undesirable facilities
• Vertex fusion under diameter constraints
• The Location of Undesirable Facilities
• Center location problems on tree graphs with subtree-shaped customers
• LexBFS-orderings and powers of graphs
• Facility location on a tree with maximum distance constraints
• Measuring diversity. A review and an empirical analysis
• Good solutions to discrete noxious location problems via metaheuristics
• A heuristic approach for the max-min diversity problem based on max-clique
• Confined location of facilities on a graph
• Locational analysis
• GRASP and path relinking for the max-min diversity problem
• Formulations and valid inequalities for the capacitated dispersion problem
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The discrete p-maxian location problem
• Continuous bottleneck tree partitioning problems
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• Some personal views on the current state and the future of locational analysis
• Powers of hhd-free graphs^∗
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Improved approximability and non-approximability results for graph diameter decreasing problems
• Review of obnoxious facilities location problems
• Polynomially bounded algorithms for locatingp-centers on a tree
• Lexbfs-orderings and powers of hhd-free graphs^∗

This page was built for publication: Location on Tree Networks: P-Centre and n-Dispersion Problems

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