The \(k\)-centrum multi-facility location problem
From MaRDI portal
Publication:5931794
DOI10.1016/S0166-218X(00)00253-5zbMath0986.90018MaRDI QIDQ5931794
Publication date: 25 September 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Discrete location and assignment (90B80)
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Worst-case incremental analysis for a class ofp-facility location problems, Ordered median problem with demand distribution weights, A revised variable neighborhood search for the discrete ordered median problem, The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, Data relaying with constraints in hierarchical sensor networks, On discrete optimization with ordering, Revisiting \(k\)-sum optimization, A kernel search heuristic for a fair facility location problem, Conditional median as a robust solution concept for uncapacitated location problems, On solving the planar \(k\)-centrum problem with Euclidean distances, Constraint relaxation for the discrete ordered median problem, An inverse approach to convex ordered median problems in trees, Unnamed Item, Sorting weighted distances with applications to objective function evaluations in single facility location problems., Bridging \(k\)-sum and CVaR optimization in MILP, The \(k\)-centrum straight-line location problem, Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces, The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game, Some polynomially solvable cases of the inverse ordered 1-median problem on trees, Ordered weighted average optimization in multiobjective spanning tree problem, Locating tree-shaped facilities using the ordered median objective, Smoothing method for minimizing the sum of therlargest functions, On single-source capacitated facility location with cost and fairness objectives, The \(k\)-centrum shortest path problem, Finding an Euclidean anti-\(k\)-centrum location of a set of points, Improved complexity results for several multifacility location problems on trees, The ordered \(k\)-median problem: surrogate models and approximation algorithms, An efficient algorithm for the Euclidean \(r\)-centrum location problem, Continuous Center Problems, Fair optimization and networks: a survey, Minimizing the sum of the \(k\) largest functions in linear time., A branch-and-price approach for the continuous multifacility monotone ordered median problem, Algorithmic results for ordered median problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- Improved complexity bounds for location problems on the real line
- Geometric lower bounds for parametric matroid optimization
- Some new algorithms for location problems on networks
- Structured \(p\)-facility location problems on the line solvable in polynomial time
- On levels in arrangements of lines, segments, planes, and triangles
- Improved bounds for planar \(k\)-sets and related problems
- Time bounds for selection
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- A constant-factor approximation algorithm for the k -median problem (extended abstract)
- New Results on the Complexity of p-Centre Problems
- Properties of thek-centra in a tree network
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- The concave least-weight subsequence problem revisited
- Centers to centroids in graphs
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Slowing down sorting networks to obtain faster sorting algorithms
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Fibonacci heaps and their uses in improved network optimization algorithms
