Data:
Dataset for the paper "A branch-and-cut algorithm for submodular interdiction games"

Simple item page
dc.contributor.authorSinnl, Markus
dc.contributor.authorTANINMIŞ, KÜBRA
dc.contributor.orcid0000-0003-1439-8702
dc.contributor.orcid0000-0003-1081-4182
dc.date.accessioned2025-10-24T11:11:16Z
dc.date.issued2022-03-30
dc.description.abstractThis dataset contains the code and the instances from the paper "A branch-and-cut algorithm for submodular interdiction games" https://doi.org/10.1287/ijoc.2022.1196 . This research was funded in whole, or in part, by the Austrian Science Fund [Grant P 35160-N].
dc.description.urihttps://dx.doi.org/10.5281/zenodo.15079151
dc.description.urihttps://dx.doi.org/10.5281/zenodo.15079152
dc.identifier.doi10.5281/zenodo.15079151
dc.identifier.openairedoi_dedup___::d7baca0769af1ae146e6bcb142d99d94
dc.identifier.urihttps://hdl.handle.net/20.500.14288/31164
dc.publisherZenodo
dc.titleDataset for the paper "A branch-and-cut algorithm for submodular interdiction games"
dc.typeDataset
dspace.entity.typeData
local.import.sourceOpenAire

Files

Collections

Research Data