Minimizing the sum of the $k$ largest functions in linear time.

DOI10.1016/S0020-0190(02)00370-8zbMath1050.68155OpenAlexW2150338193MaRDI QIDQ1853685

Publication date: 22 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00370-8

zbMATH Keywords

Algorithms Computational geometry Location Rectilinear

Mathematics Subject Classification ID

Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

A note on the subtree ordered median problem in networks based on nestedness property, Equitable aggregations and multiple criteria analysis, On the unified dispersion problem: efficient formulations and exact algorithms, Ordered median problem with demand distribution weights, 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, Finding the nucleolus of any $n$-person cooperative game by a single linear program, Mathematical programming formulations for the efficient solution of the $k$-sum approval voting problem, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, The nestedness property of location problems on the line, Revisiting $k$-sum optimization, Review of obnoxious facilities location problems, The ordered capacitated facility location problem, Conditional median as a robust solution concept for uncapacitated location problems, Segmentation of scanning-transmission electron microscopy images using the ordered median problem, On solving the planar $k$-centrum problem with Euclidean distances, Ordered $p$-median problems with neighbourhoods, Approximating combinatorial optimization problems with the ordered weighted averaging criterion, A fresh view on the discrete ordered median problem based on partial monotonicity, Fairness in maximal covering location problems, Reference point method with importance weighted ordered partial achievements, Optimization problems with flexible objectives: a general modeling approach and applications, Alternative formulations for the obnoxious $p$-median problem, Sorting weighted distances with applications to objective function evaluations in single facility location problems., Bridging $k$-sum and CVaR optimization in MILP, Ordered weighted average combinatorial optimization: formulations and their properties, WOWA Enhancement of the Preference Modeling in the Reference Point Method, 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, A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment, Balanced flows for transshipment problems, A relative robust approach on expected returns with bounded CVaR for portfolio selection, The 2-radius and 2-radiian problems on trees, Ordered weighted average optimization in multiobjective spanning tree problem, An optimal randomized algorithm for $d$-variate zonoid depth, Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling, Conditional value at risk and related linear programming models for portfolio optimization, On efficient WOWA optimization for decision support under risk, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Multi-dimensional dynamic facility location and fast computation at query points, Locating tree-shaped facilities using the ordered median objective, Single-allocation ordered median hub location problems, Smoothing method for minimizing the sum of therlargest functions, On the multisource hyperplanes location problem to fitting set of points, A comparison of formulations and solution methods for the minimum-envy location problem, Finding an Euclidean anti-$k$-centrum location of a set of points, On solving linear programs with the ordered weighted averaging objective., On the characterization of saddle point equilibrium for security games with additive utility, 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, On Universal Shortest Paths, Distribution systems design with role dependent objectives, The nestedness property of the convex ordered median location problem on a tree, An efficient algorithm for the Euclidean $r$-centrum location problem, Fair optimization and networks: a survey, Algorithmic results for ordered median problems

Cites Work

Minimizing the sum of the \(k\) largest functions in linear time.