Min-max-min robust combinatorial optimization
type: Item
instance of: scholarly article
title: Min-max-min robust combinatorial optimization
zbMATH Open document ID: 1365.90224
author: Christoph Buchheim
author: Jannis Kurtz
published in: Mathematical Programming. Series A. Series B
publication date: 2017-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6715560
zbMATH Keywords: robust optimization
zbMATH Keywords: \(k\)-adaptability
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10107-016-1053-z
OpenAlex ID: W2473069854
cites work: Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Robust convex optimization
cites work: Finite Adaptability in Multistage Linear Optimization
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Infinitely constrained optimization problems
cites work: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
cites work: Recoverable robust shortest path problems
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Q3329225
cites work: Geometric algorithms and combinatorial optimization.
cites work: K-Adaptability in Two-Stage Robust Binary Programming
cites work: Robust discrete optimization and its applications
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
cites work: Robust linear optimization under general norms.
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
DOI: 10.1007/S10107-016-1053-Z
Recommended article: Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
Recommended article: Min max min robust (relative) regret combinatorial optimization
Recommended article: Minmax combinatorial optimization
Recommended article: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
Recommended article: Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
Recommended article: Q4883383
Recommended article: Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
Recommended article: Q3330973
Recommended article: Min-max and robust polynomial optimization
Recommended article: Minmax robustness for multi-objective optimization problems
description: scientific article; zbMATH DE number 6715560