Minimizing the sum of the \(k\) largest functions in linear time.
From MaRDI portal
Publication:1853685
DOI10.1016/S0020-0190(02)00370-8zbMath1050.68155MaRDI QIDQ1853685
Arie Tamir, Włodzimierz Ogryczak
Publication date: 22 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
90B85: Continuous location
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment, Smoothing method for minimizing the sum of therlargest functions, The ordered capacitated facility location problem, Conditional median as a robust solution concept for uncapacitated location problems, On solving the planar \(k\)-centrum problem with Euclidean distances, Single-allocation ordered median hub location problems, Finding an Euclidean anti-\(k\)-centrum location of a set of points, The 2-radius and 2-radiian problems on trees, On efficient WOWA optimization for decision support under risk, Multi-dimensional dynamic facility location and fast computation at query points, A comparison of formulations and solution methods for the minimum-envy location problem, Inequality measures and equitable locations, Up- and downgrading the 1-center in a network, A flexible model and efficient solution strategies for discrete location problems, Distribution systems design with role dependent objectives, Sorting weighted distances with applications to objective function evaluations in single facility location problems., Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces, Locating tree-shaped facilities using the ordered median objective, On solving linear programs with the ordered weighted averaging objective., Algorithmic results for ordered median problems, Equitable aggregations and multiple criteria analysis, On the planar piecewise quadratic 1-center problem, Ordered weighted enhancement of preference modeling in the reference point method for multiple criteria optimization, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, An optimal randomized algorithm for \(d\)-variate zonoid depth, Conditional value at risk and related linear programming models for portfolio optimization, An efficient algorithm for the Euclidean \(r\)-centrum location problem, WOWA Enhancement of the Preference Modeling in the Reference Point Method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- Inequality measures and equitable approaches to location problems
- Algorithmic results for ordered median problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Properties of thek-centra in a tree network
- Medi-Centers of a Tree
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Linear Programming in Linear Time When the Dimension Is Fixed
- 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
- Minimax parametric optimization problems and multi-dimensional parametric searching
- 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
- The \(k\)-centrum multi-facility location problem
