Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
type: Item
instance of: scholarly article
title: Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
zbMATH Open document ID: 1411.90066
author: Nader Azizi
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7032641
zbMATH Keywords: hub-and-spoke
zbMATH Keywords: reliability
zbMATH Keywords: hub failure
zbMATH Keywords: particle swarm optimization
zbMATH Keywords: indicator constraints
Wikidata QID: Q59614610
MaRDI profile type: Publication
full work available at URL: s10479-017-2517-0
OpenAlex ID: W2614695059
cites work: A hybrid heuristic for the uncapacitated hub location problem
cites work: Network hub location problems: The state of the art
cites work: Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
cites work: The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
cites work: On mathematical programming with indicator constraints
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: A new linearization technique for multi-quadratic 0-1 programming problems.
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: A conditional \(p\)-hub location problem with attraction functions
cites work: A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: Solving the hub location problem with modular link capacities
DOI: 10.1007/S10479-017-2517-0
description: scientific article; zbMATH DE number 7032641