Pages that link to "Item:Q1754202"
From MaRDI portal
The following pages link to An implicit enumeration algorithm for the hub interdiction median problem with fortification (Q1754202):
Displaying 13 items.
- Optimizing fortification plan of capacitated facilities with maximum distance limits (Q1735969) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
- An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
- On the \(p\)-hub interdiction problem (Q2664408) (← links)
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem (Q2673530) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information (Q6091866) (← links)
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach (Q6160968) (← links)
