Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion

DOI10.1016/j.orl.2013.08.014zbMath1287.90056arXiv1307.4521OpenAlexW2034108852MaRDI QIDQ2450748

Paweł Zieliński, Adam Kasperski

Publication date: 15 May 2014

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

Full work available at URL: https://arxiv.org/abs/1307.4521

zbMATH Keywords

computational complexitycombinatorial optimizationrobust optimizationOWA criterionbottleneck problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

Lawler's minmax cost algorithm: optimality conditions and uncertainty ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Sensitivity analysis for bottleneck assignment problems ⋮ Ordered weighted average combinatorial optimization: formulations and their properties ⋮ Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• A linear time algorithm for the maximum capacity path problem
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• The Min-Max Spanning Tree Problem and some extensions
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Minmax regret solutions for minimax optimization problems with uncertainty
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• On solving linear programs with the ordered weighted averaging objective.
• A fast algorithm for a class of bottleneck problems
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Algorithms for two bottleneck optimization problems
• The Minimum Satisfiability Problem
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion