Pages that link to "Item:Q623776"

The following pages link to The budget constrained \(r\)-interdiction median problem with capacity expansion (Q623776):

Displaying 34 items.

• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
• Protection issues for supply systems involving random attacks (Q336905) (← links)
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
• A bi-level programming model for protection of hierarchical facilities under imminent attacks (Q342087) (← links)
• Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network (Q450150) (← links)
• On the multicriteria allocation problem (Q490242) (← links)
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• Optimizing fortification plan of capacitated facilities with maximum distance limits (Q1735969) (← links)
• Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
• An analytical approach to the protection planning of a rail intermodal terminal network (Q1752835) (← links)
• An implicit enumeration algorithm for the hub interdiction median problem with fortification (Q1754202) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• Incorporating the threat of terrorist attacks in the design of public service facility networks (Q1758055) (← links)
• A bilevel fixed charge location model for facilities under imminent attack (Q1762124) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• On the hardness of covering-interdiction problems (Q2031041) (← links)
• Interdicting facilities in tree networks (Q2121611) (← links)
• Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models (Q2136875) (← links)
• A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
• Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
• An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
• A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
• A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
• A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
• Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios (Q4558293) (← links)
• (Q4980801) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• Designing a model for service facility protection with a time horizon based on tri-level programming (Q5059288) (← links)
• Efficient Solution Methods for a General <i>r</i>-Interdiction Median Problem with Fortification (Q5086024) (← links)
• An exact approach for the r-interdiction median problem with fortification (Q5242354) (← links)
• A capacity expansion problem with budget constraint and bottleneck limitation (Q5959689) (← links)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)