Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty

DOI10.1007/978-3-662-48971-0_42zbMath1472.68213arXiv1401.7043OpenAlexW2153675120MaRDI QIDQ3459887

Sang Chin, Andrew Mastin, Patrick Jaillet

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

game theoryrobust optimizationapproximation algorithms

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Applications of game theory (91A80) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ A double oracle approach to minmax regret optimization problems with interval data ⋮ Compromise solutions for robust combinatorial optimization with variable-sized uncertainty ⋮ Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty ⋮ Robust Randomized Matchings

This page was built for publication: Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty