Pages that link to "Item:Q2976146"

The following pages link to Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146):

Displayed 5 items.

• On the hardness of covering-interdiction problems (Q2031041) ‎ (← links)
• An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) ‎ (← links)
• Interdicting facilities in tree networks (Q2121611) ‎ (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) ‎ (← links)
• Vertex downgrading to minimize connectivity (Q6038644) ‎ (← links)