Worst-case incremental analysis for a class ofp-facility location problems

DOI10.1002/net.10021zbMath1012.90027OpenAlexW2044576475MaRDI QIDQ4537620

Arie Tamir, Timothy J. Lowe, Richard L. Francis

Publication date: 1 July 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10021

zbMATH Keywords

aggregationlocationincremental analysis\(p\)-medianworst case

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Complexity and performance of numerical algorithms (65Y20)

Related Items

The \(p\)-median problem: a survey of metaheuristic approaches, Continuous approximation formulas for location problems, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, An aggregation heuristic for large scale p-median problem, Locating tree-shaped facilities using the ordered median objective, Aggregation error for location models: Survey and analysis, On the exponential cardinality of FDS for the ordered \(p\)-median problem

Cites Work

• Unnamed Item
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• Properties of thek-centra in a tree network
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• Medi-Centers of a Tree
• Centers to centroids in graphs
• Duality in the Cent-Dian of a Graph
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Aggregation Error Bounds for a Class of Location Models
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The \(k\)-centrum multi-facility location problem