Revisiting \(k\)-sum optimization (Q1675256)

From MaRDI portal

Revision as of 14:58, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Revisiting \(k\)-sum optimization (English)

0 references

0 references

0 references

Antonio M. Rodríguez-Chía

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

27 October 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-016-1096-1

0 references

0 references

Finding cores of limited length

0 references

Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs

0 references

Algorithms for path medi-centers of a tree

0 references

On the p-median polytope of fork-free graphs

0 references

Robust discrete optimization and network flows

0 references

Lexicographic bottleneck problems

0 references

0 references

Slowing down sorting networks to obtain faster sorting algorithms

0 references

An improved general procedure for lexicographic bottleneck problems

0 references

On discrete optimization with ordering

0 references

Ordered weighted average combinatorial optimization: formulations and their properties

0 references

The \(k\)-centrum shortest path problem

0 references

The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game

0 references

Geometric algorithms and combinatorial optimization

0 references

k-sum optimization problems

0 references

On locating path- or tree-shaped facilities on networks

0 references

Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

0 references

Medi-Centers of a Tree

0 references

Improved complexity bounds for location problems on the real line

0 references

Improved complexity results for several multifacility location problems on trees

0 references

Algorithmic results for ordered median problems

0 references

Multifacility ordered median problems on networks: A further analysis

0 references

0 references

0 references

Balanced optimization problems

0 references

Combinatorial Optimization with Rational Objective Functions

0 references

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

0 references

Improved algorithms for several network location problems with equality measures.

0 references

Location Theory

0 references

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

0 references

0 references

Locating tree-shaped facilities using the ordered median objective

0 references

<i>K</i>-Sum Linear Programming

0 references

On \(k\)-sum optimization

0 references

0 references

Centers to centroids in graphs

0 references

Thek-nucleus of a graph

0 references

An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs

0 references

Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem

0 references

The \(k\)-centrum multi-facility location problem

0 references

A polynomial algorithm for thep-centdian problem on a tree

0 references

The centdian subtree on tree networks

0 references

A strongly polynomial minimum cost circulation algorithm

0 references

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-016-1096-1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1675256

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1675256&oldid=36353579"