On \(k\)-Max-optimization

DOI10.1016/j.orl.2008.09.007zbMath1154.90605OpenAlexW2043818210MaRDI QIDQ1002079

Stefan Ruzika, Jochen Gorski

Publication date: 23 February 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.09.007

zbMATH Keywords

combinatorial optimizationmin-Maxbottleneck objectiveBottleneck problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ Biobjective optimization problems on matroids with binary costs ⋮ On generalized balanced optimization problems ⋮ Generalized multiple objective bottleneck problems ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ Shortest paths with ordinal weights

Cites Work

• An improved general procedure for lexicographic bottleneck problems
• Lexicographic bottleneck combinatorial problems
• Lexicographic balanced optimization problems
• On \(k\)-sum optimization
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope
• Generalized Bottleneck Problems^∗
• Spanning Trees—Short or Small

This page was built for publication: On \(k\)-Max-optimization