Algorithmic results for ordered median problems
From MaRDI portal
Publication:1866979
DOI10.1016/S0167-6377(02)00121-9zbMath1010.90036WikidataQ58217342 ScholiaQ58217342MaRDI QIDQ1866979
Jörg Kalcsics, Justo Puerto, Stefan Nickel, Arie Tamir
Publication date: 2 April 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks, Equitable aggregations and multiple criteria analysis, Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions, A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, On \(k\) nearest points of a finite set in a normed linear space, Ordered median problem with demand distribution weights, Solving the ordered one-median problem in the plane, Unreliable point facility location problems on networks, Extensions to the Weber problem, The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance, Reduced pairs of compact convex sets and ordered median functions, Minmax regret location--allocation problem on a network under uncertainty, The nestedness property of location problems on the line, On discrete optimization with ordering, Revisiting \(k\)-sum optimization, Minmax regret maximal covering location problems with edge demands, The ordered capacitated facility location problem, On solving the planar \(k\)-centrum problem with Euclidean distances, A fresh view on the discrete ordered median problem based on partial monotonicity, An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions, An inverse approach to convex ordered median problems in trees, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Sorting weighted distances with applications to objective function evaluations in single facility location problems., A generalized model of equality measures in network location problems, Inverse \(k\)-centrum problem on trees with variable vertex weights, Some polynomially solvable cases of the inverse ordered 1-median problem on trees, Ordered weighted average optimization in multiobjective spanning tree problem, The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases, The ordered gradual covering location problem on a network, Multi-facility ordered median problems in directed networks, Locating tree-shaped facilities using the ordered median objective, Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem, Finding an Euclidean anti-\(k\)-centrum location of a set of points, Convex ordered median problem with \(\ell _p\)-norms, Improved complexity results for several multifacility location problems on trees, The ordered \(k\)-median problem: surrogate models and approximation algorithms, Constructing a DC decomposition for ordered median problems, A combinatorial algorithm for the ordered 1-median problem on cactus graphs, The \(p\)-facility ordered median problem on networks, An efficient algorithm for the Euclidean \(r\)-centrum location problem, Fair optimization and networks: a survey, Minimizing the sum of the \(k\) largest functions in linear time., On the exponential cardinality of FDS for the ordered \(p\)-median problem, Heuristic procedures for solving the discrete ordered median problem
Cites Work
- Sorting in \(c \log n\) parallel steps
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Minimizing the sum of the \(k\) largest functions in linear time.
- A flexible approach to location problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Centers to centroids in graphs
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Finite Dominating Sets for Network Location Problems
- Convex Location Problems on Tree Networks
- The single facility location problem with minimum distance constraints
- Aggregation Error Bounds for a Class of Location Models
- Slowing down sorting networks to obtain faster sorting algorithms
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Minimax parametric optimization problems and multi-dimensional parametric searching
- On bisectors for different distance functions
- The \(k\)-centrum multi-facility location problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
