Revisiting \(k\)-sum optimization (Q1675256): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cores of limited length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for path medi-centers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the p-median polytope of fork-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved general procedure for lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On discrete optimization with ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered weighted average combinatorial optimization: formulations and their properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-sum optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medi-Centers of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bounds for location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity results for several multifacility location problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for ordered median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multifacility ordered median problems on networks: A further analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for several network location problems with equality measures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the \(k\) largest functions in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating tree-shaped facilities using the ordered median objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i>-Sum Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-sum optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centers to centroids in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-nucleus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum multi-facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for thep-centdian problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Revision as of 14:58, 14 July 2024

scientific article
Language Label Description Also known as
English
Revisiting \(k\)-sum optimization
scientific article

    Statements

    Revisiting \(k\)-sum optimization (English)
    0 references
    0 references
    0 references
    27 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references