遇见数据集

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

收藏
Zenodo2025-03-24 更新2026-05-26 收录
官方服务:

资源简介:

This 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].

提供机构:
Zenodo
创建时间:
2025-03-24
二维码
社区交流群
二维码
科研交流群
商业服务