Show simple item record

dc.contributor.author
Adjiashvili, David
dc.contributor.author
Stiller, Sebastian
dc.contributor.author
Zenklusen, Rico
dc.date.accessioned
2022-08-08T07:39:09Z
dc.date.available
2017-06-11T16:14:03Z
dc.date.available
2022-08-08T07:39:09Z
dc.date.issued
2015-02
dc.identifier.issn
0025-5610
dc.identifier.issn
1436-4646
dc.identifier.other
10.1007/s10107-014-0760-6
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/98284
dc.identifier.doi
10.3929/ethz-b-000098284
dc.description.abstract
We commence an algorithmic study of Bulk-Robustness, a new model of robustness in combinatorial optimization. Unlike most existing models, Bulk-Robust combinatorial optimization features a highly nonuniform failure model. Instead of an interdiction budget, Bulk-Robust counterparts provide an explicit list of interdiction sets, comprising the admissible set of scenarios, thus allowing to model correlations between failures of different components in the system, interdiction sets of variable cardinality and more. The resulting model is suitable for capturing failures of complex structures in the system. We provide complexity results and approximation algorithms for Bulk-Robust counterparts of the Minimum Matroid Basis problems and the Shortest Path problem. Our results rely on various techniques, and outline the rich and heterogeneous combinatorial structure of Bulk-Robust optimization.
en_US
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
Springer
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.subject
Robust optimization
en_US
dc.subject
Combinatorial optimization
en_US
dc.subject
Matroid
en_US
dc.subject
Shortest path
en_US
dc.subject
Fault tolerant
en_US
dc.title
Bulk-Robust combinatorial optimization
en_US
dc.type
Journal Article
dc.rights.license
In Copyright - Non-Commercial Use Permitted
dc.date.published
2014-02-13
ethz.journal.title
Mathematical Programming
ethz.journal.volume
149
en_US
ethz.journal.issue
1-2
en_US
ethz.journal.abbreviated
Math. Program.
ethz.pages.start
361
en_US
ethz.pages.end
390
en_US
ethz.version.deposit
publishedVersion
en_US
ethz.notes
It was possible to publish this article open access thanks to a Swiss National Licence with the publisher.
en_US
ethz.identifier.wos
ethz.identifier.nebis
000024930
ethz.publication.place
Heidelberg
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02000 - Dep. Mathematik / Dep. of Mathematics::02502 - Institut für Operations Research / Institute for Operations Research::09487 - Zenklusen, Rico / Zenklusen, Rico
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02000 - Dep. Mathematik / Dep. of Mathematics::02502 - Institut für Operations Research / Institute for Operations Research::09487 - Zenklusen, Rico / Zenklusen, Rico
ethz.date.deposited
2017-06-11T16:14:39Z
ethz.source
ECIT
ethz.identifier.importid
imp593652f12efb867533
ethz.ecitpid
pub:153734
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-07-12T18:15:47Z
ethz.rosetta.lastUpdated
2022-03-28T13:42:27Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Bulk-Robust%20combinatorial%20optimization&rft.jtitle=Mathematical%20Programming&rft.date=2015-02&rft.volume=149&rft.issue=1-2&rft.spage=361&rft.epage=390&rft.issn=0025-5610&1436-4646&rft.au=Adjiashvili,%20David&Stiller,%20Sebastian&Zenklusen,%20Rico&rft.genre=article&rft_id=info:doi/10.1007/s10107-014-0760-6&
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record