Revisiting k-sum optimization
From MaRDI portal
Revisiting \(k\)-sum optimization
Recommendations
Cites work
- K-Sum Linear Programming
- A polynomial algorithm for thep-centdian problem on a tree
- A strongly polynomial minimum cost circulation algorithm
- Algorithmic results for ordered median problems
- Algorithms for path medi-centers of a tree
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An improved general procedure for lexicographic bottleneck problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Balanced optimization problems
- Centers to centroids in graphs
- Combinatorial Optimization with Rational Objective Functions
- Finding cores of limited length
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- Geometric algorithms and combinatorial optimization
- Geometrical properties of the symmetrical single facility location problem
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 961964 (Why is no real title available?)
- Improved algorithms for several network location problems with equality measures.
- Improved complexity bounds for location problems on the real line
- Improved complexity results for several multifacility location problems on trees
- k-sum optimization problems
- Lexicographic bottleneck problems
- Locating tree-shaped facilities using the ordered median objective
- Location theory. A unified approach
- Maximizing concave functions in fixed dimension
- Medi-Centers of a Tree
- Minimizing the sum of the \(k\) largest functions in linear time.
- Multifacility ordered median problems on networks: A further analysis
- Network flows. Theory, algorithms, and applications.
- On \(k\)-sum optimization
- On discrete optimization with ordering
- On locating path- or tree-shaped facilities on networks
- On the p-median polytope of fork-free graphs
- Ordered weighted average combinatorial optimization: formulations and their properties
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- Robust discrete optimization and network flows
- Slowing down sorting networks to obtain faster sorting algorithms
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- The k-centrum multi-facility location problem
- The \(k\)-centrum shortest path problem
- The centdian subtree on tree networks
- Thek-nucleus of a graph
Cited in
(20)- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
- Extensive facility location problems on networks: an updated review
- The nestedness property of location problems on the line
- Bridging \(k\)-sum and CVaR optimization in MILP
- New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation
- On \(k\)-sum optimization
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs
- A fresh view on the discrete ordered median problem based on partial monotonicity
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Ordered \(p\)-median problems with neighbourhoods
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- K-Sum Linear Programming
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
- Summation of the enumerators in the discrete optimization problems
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- Summation of the enumerators in the discrete optimization problems
- Managing ESG ratings disagreement in sustainable portfolio selection
- Flexible enhanced indexation models through stochastic dominance and ordered weighted average optimization
- Ordered median traveling salesman problem
- k-sum optimization problems
This page was built for publication: Revisiting \(k\)-sum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675256)
