An implicit enumeration algorithm for the hub interdiction median problem with fortification
type: Item
instance of: scholarly article
title: An implicit enumeration algorithm for the hub interdiction median problem with fortification
zbMATH Open document ID: 1403.90112
author: Reza Atayi
author: Nader Ghaffari-Nasab
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6876624
zbMATH Keywords: transportation
zbMATH Keywords: hub interdiction problem
zbMATH Keywords: fortification
zbMATH Keywords: bilevel programming
zbMATH Keywords: implicit enumeration
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.11.035
OpenAlex ID: W2769936923
cites work: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
cites work: The budget constrained \(r\)-interdiction median problem with capacity expansion
cites work: Network hub location problems: The state of the art
cites work: The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Integer programming formulations of discrete hub location problems
cites work: Foundations of bilevel programming
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
cites work: Optimizing system resilience: a facility protection model with recovery time
cites work: Design of a reliable logistics network with hub disruption under uncertainty
cites work: Designing robust coverage networks to hedge against worst-case facility losses
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
cites work: A bilevel mixed-integer program for critical infrastructure protection planning
cites work: An exact solution approach for the interdiction median problem with fortification
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: A hub covering model for cargo delivery systems
cites work: The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
DOI: 10.1016/J.EJOR.2017.11.035
description: scientific article; zbMATH DE number 6876624