Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
type: Item
instance of: scholarly article
title: Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
zbMATH Open document ID: 1403.90488
author: Prasanna Ramamoorthy
author: Sachin Jayaswal
author: Ankur Sinha
author: Navneet Vidyarthi
published in: European Journal of Operational Research
publication date: 2018-05-31T00:00:00Z
full work available at URL: Ramamoorthy-2018.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6877281
zbMATH Keywords: location
zbMATH Keywords: hub-and-spoke network
zbMATH Keywords: interdiction
zbMATH Keywords: protection
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
OpenAlex ID: W2794659965
cites work: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
cites work: A bilevel fixed charge location model for facilities under imminent attack
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: Links between linear bilevel and mixed 0-1 programming problems
cites work: The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Optimal location with equitable loads
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Location and the p-Hub Median Problem
cites work: Stochastic uncapacitated hub location
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: The tree of hubs location problem
cites work: Most vital links and nodes in weighted networks
cites work: Stochastic network interdiction
cites work: Competitive Location on a Network
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Hub-and-spoke network design with congestion
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Closest assignment constraints in discrete location problems
cites work: On a new class of bilevel programming problems and its use for reformulating mixed integer problems
cites work: Closest assignment constraints and location models: Properties and structure
cites work: An implicit enumeration algorithm for the hub interdiction median problem with fortification
cites work: Hub interdiction problem variants: models and metaheuristic solution algorithms
cites work: Optimal Interdiction of Unreactive Markovian Evaders
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Shortest-path network interdiction
cites work: Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
cites work: On a bi-level formulation to protect uncapacitated \(p\)-median systems with facility recovery time and frequent disruptions
cites work: The stochastic interdiction median problem with disruption intensity levels
cites work: Optimal interdiction of a supply network
cites work: Minimizing a stochastic maximum-reliability path
cites work: Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
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: Survivable network design under optimal and heuristic interdiction scenarios
cites work: An exact algorithm for the modular hub location problem with single assignments
cites work: A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
cites work: Two-Person Zero-Sum Games for Network Interdiction
cites work: Deterministic network interdiction
Wikidata QID: Q130050899
DOI: 10.1016/J.EJOR.2018.03.031
description: scientific article; zbMATH DE number 6877281