On worst-case aggregation analysis for network location problems

DOI10.1007/BF02060479zbMath0787.90046OpenAlexW1974612147MaRDI QIDQ689246

Timothy J. Lowe, Richard L. Francis

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02060479

zbMATH Keywords

network locationfacility locations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Transportation, logistics and supply chain management (90B06)

Related Items

Aggregation in hub location problems, A framework for demand point and solution space aggregation analysis for location models, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, A quadtree-based allocation method for a class of large discrete Euclidean location problems, On solving large instances of the capacitated facility location problem, Location and layout planning. A survey, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, Comparative error bound theory for three location models: continuous demand versus discrete demand, Challenges and Advances in A Priori Routing, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, Aggregation for the probabilistic traveling salesman problem, Geographical information systems and location science, A continuous analysis framework for the solution of location-allocation problems with dense demand, Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem, Aggregation error for location models: Survey and analysis, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, Demand point aggregation for planar covering location models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aggregation effects in maximum covering models
• Location problems
• Easy and hard bottleneck location problems
• Algorithms for the m-center problems: A survey
• Locational analysis
• Selected Families of Location Problems
• Cluster Analysis: An Application of Lagrangian Relaxation
• Parameter estimation for the EOQ lot-size model: Minimax and expected value choices
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An Overview of Representative Problems in Location Research
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Worst-Case Analysis of Heuristic Algorithms
• Localizing 2‐medians on probabilistic and deterministic tree networks
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Distance Constraints for Tree Network Multifacility Location Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph