An implicit enumeration algorithm for the hub interdiction median problem with fortification

DOI10.1016/j.ejor.2017.11.035zbMath1403.90112OpenAlexW2769936923MaRDI QIDQ1754202

Reza Atayi, Nader Ghaffari-Nasab

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.035

zbMATH Keywords

transportationbilevel programmingimplicit enumerationfortificationhub interdiction problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (13)

Interdicting facilities in tree networks ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ On the \(p\)-hub interdiction problem ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Perspectives on modeling hub location problems ⋮ An exact algorithm for solving the bilevel facility interdiction and fortification problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
• Optimizing system resilience: a facility protection model with recovery time
• Designing robust coverage networks to hedge against worst-case facility losses
• The budget constrained \(r\)-interdiction median problem with capacity expansion
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Practical bilevel optimization. Algorithms and applications
• Integer programming formulations of discrete hub location problems
• Foundations of bilevel programming
• Design of a reliable logistics network with hub disruption under uncertainty
• A bilevel mixed-integer program for critical infrastructure protection planning
• An exact solution approach for the interdiction median problem with fortification
• Network hub location problems: The state of the art
• A hub covering model for cargo delivery systems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

This page was built for publication: An implicit enumeration algorithm for the hub interdiction median problem with fortification