Author:
Averbakh Igor,Lebedev Vasilij
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
2. Minmax regret solutions for minimax optimization problems with uncertainty;Averbakh;Oper. Res. Lett.,2000
3. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Math. Programming,2001
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Robust discrete optimization and its applications;Kouvelis,1997
Cited by
99 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robust Spanning Tree Problems;International Series in Operations Research & Management Science;2024
2. Robust Shortest Path Problems;International Series in Operations Research & Management Science;2024
3. Robust Selection Problems;International Series in Operations Research & Management Science;2024
4. Combinatorial optimization problems with balanced regret;Discrete Applied Mathematics;2023-03
5. Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty;RAIRO - Operations Research;2022-11