Pages that link to "Item:Q2672065"
From MaRDI portal
The following pages link to Integer programming methods for solving binary interdiction games (Q2672065):
Displaying 10 items.
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
- (Q5115403) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- A branch-and-cut algorithm for submodular interdiction games (Q6364047) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
- Shortest path network interdiction with incomplete information: a robust optimization approach (Q6547018) (← links)
- An optimal algorithm for variable knockout problems (Q6655140) (← links)