首页 | 本学科首页   官方微博 | 高级检索  
     


Bulk-Robust combinatorial optimization
Authors:Adjiashvili  David  Stiller  Sebastian  Zenklusen  Rico
Affiliation:1.Institute for Operations Research, ETH Zürich, Rämistrasse 101, 8092 , Zurich, Switzerland
;2.Department of Mathematics, Berlin Institute of Technology, Strasse des 17. Juni 136, 10623 , Berlin, Germany
;3.Department of Mathematics, ETH Zürich, Rämistrasse 101, 8092 , Zurich, Switzerland
;4.Department of Applied Mathematics and Statistics, Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD, 21218, USA
;
Abstract:Mathematical Programming - We commence an algorithmic study of Bulk-Robustness, a new model of robustness in combinatorial optimization. Unlike most existing models, Bulk-Robust combinatorial...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号