On worst-case aggregation analysis for network location problems
From MaRDI portal
(Redirected from Publication:689246)
Recommendations
- An Analysis of Network Location Problems with Distance Constraints
- scientific article; zbMATH DE number 1394671
- Aggregation in hub location problems
- Some new algorithms for location problems on networks
- scientific article; zbMATH DE number 3847184
- Network hub location problems: The state of the art
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Computation of lower bounds on the network cost in location problems subject to distance constraints
- scientific article; zbMATH DE number 1501880
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3847184 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1544182 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Aggregation effects in maximum covering models
- Algorithms for the m-center problems: A survey
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Overview of Representative Problems in Location Research
- Cluster Analysis: An Application of Lagrangian Relaxation
- Distance Constraints for Tree Network Multifacility Location Problems
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- Easy and hard bottleneck location problems
- Localizing 2‐medians on probabilistic and deterministic tree networks
- Location problems
- Locational analysis
- 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
- Parameter estimation for the EOQ lot-size model: Minimax and expected value choices
- Selected Families of Location Problems
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Worst-Case Analysis of Heuristic Algorithms
Cited in
(19)- Aggregation effects in maximum covering models
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- Aggregation for the probabilistic traveling salesman problem
- Demand point aggregation for planar covering location models
- Worst-case incremental analysis for a class ofp-facility location problems
- Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
- A framework for demand point and solution space aggregation analysis for location models
- Location and layout planning. A survey
- Aggregation in hub location problems
- Aggregation error for location models: Survey and analysis
- On solving large instances of the capacitated facility location problem
- Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
- Challenges and Advances in A Priori Routing
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- Geographical information systems and location science
- A quadtree-based allocation method for a class of large discrete Euclidean location problems
- Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Comparative error bound theory for three location models: continuous demand versus discrete demand
This page was built for publication: On worst-case aggregation analysis for network location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689246)
