Pages that link to "Item:Q1209313"
From MaRDI portal
The following pages link to The most vital edges in the minimum spanning tree problem (Q1209313):
Displaying 18 items.
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Matching interdiction (Q602686) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
