One-way and round-trip center location problems
From MaRDI portal
Publication:2568335
DOI10.1016/j.disopt.2004.12.004zbMath1077.90037MaRDI QIDQ2568335
Publication date: 10 October 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.12.004
90C27: Combinatorial optimization
90B80: Discrete location and assignment
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Collection depots facility location problems in trees, Efficient algorithms for the round-trip 1-center and 1-median problems, When centers can fail: a close second opportunity, Balancing the arrival times of users in a two-stage location problem, The transfer point location problem, Center location problems on tree graphs with subtree-shaped customers, Single facility collection depots location problem in the plane, The planar multifacility collection depots location problem, On the planar piecewise quadratic 1-center problem, The facility and transfer points location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An optimal approximation algorithm for the rectilinear m-center problem
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- A heuristic for the p-center problem in graphs
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Facility location with dynamic distance functions
- Geometric pattern matching in \(d\)-dimensional space
- Fault tolerant \(K\)-center problems
- Selecting distances in the plane
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Fast Algorithms for Finding Nearest Common Ancestors
- New Results on the Complexity of p-Centre Problems
- A Best Possible Heuristic for the k-Center Problem
- One-facility location with rectilinear tour distances
- The Round-Trip p-Center and Covering Problem on a Tree
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Linear Programming in Linear Time When the Dimension Is Fixed
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Combinatorial Optimization with Rational Objective Functions
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- New Upper Bounds in Klee’s Measure Problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- Applications of Parametric Searching in Geometric Optimization
- The collection depots location problem on networks
- Slowing down sorting networks to obtain faster sorting algorithms
- Improvements on geometric pattern matching problems
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
