Pages that link to "Item:Q1989731"
From MaRDI portal
The following pages link to New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731):
Displaying 16 items.
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Optimization models of anti-terrorist protection (Q1735316) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
- Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- A survey on bilevel optimization under uncertainty (Q6096565) (← links)
- Shortest path network interdiction with asymmetric uncertainty (Q6196902) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
