Pages that link to "Item:Q2672065"

The following pages link to Integer programming methods for solving binary interdiction games (Q2672065):

Displaying 5 items.

• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• An exact method for binary fortification games (Q6167322) (← 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)