Pages that link to "Item:Q2462537"
From MaRDI portal
The following pages link to A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537):
Displaying 50 items.
- A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems (Q256666) (← links)
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- Solving discretely-constrained Nash-Cournot games with an application to power markets (Q300326) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis (Q322575) (← links)
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption (Q336602) (← links)
- A trilevel programming approach for electric grid defense planning (Q336810) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- Characterizing multi-event disaster resilience (Q336861) (← links)
- Protection issues for supply systems involving random attacks (Q336905) (← links)
- Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← 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)
- Closest assignment constraints in discrete location problems (Q439609) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- A novel algorithm for area traffic capacity control with elastic travel demands (Q622897) (← links)
- The budget constrained \(r\)-interdiction median problem with capacity expansion (Q623776) (← links)
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- Cyber-physical correlation effects in defense games for large discrete infrastructures (Q1630471) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- Models of the optimal resource allocation for the critical infrastructure protection (Q1711376) (← links)
- Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
- An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- An adaptive robust framework for the optimization of the resilience of interdependent infrastructures under natural hazards (Q1734364) (← links)
- Wireless LAN transmitter location under the threat of jamming attacks (Q1734815) (← links)
- Optimizing fortification plan of capacitated facilities with maximum distance limits (Q1735969) (← links)
- New models for the location of controversial facilities: a bilevel programming approach (Q1738822) (← links)
- Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159) (← 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)
- Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure (Q2076898) (← links)
- Network resilience (Q2144481) (← 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)
- Stackelberg production-protection games: defending crop production against intentional attacks (Q2242197) (← links)
- An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
