Reliable single allocation hub location problem under hub breakdowns
type: Item
instance of: scholarly article
title: Reliable single allocation hub location problem under hub breakdowns
zbMATH Open document ID: 1458.90455
author: Borzou Rostami
author: Nicolas Kämmerling
author: Christoph Buchheim
author: Uwe Clausen
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6901605
zbMATH Keywords: hub location
zbMATH Keywords: reliability
zbMATH Keywords: hub breakdown
zbMATH Keywords: Benders decomposition
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2018.04.002
OpenAlex ID: W2796271482
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: Integer programming formulations of discrete hub location problems
cites work: Branch and price for large-scale capacitated hub location problems with single assignment
cites work: Reliable Facility Location Design Under the Risk of Disruptions
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: Solution algorithms for the capacitated single allocation hub location problem
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Airline network design and hub location problems
cites work: Heuristics for the p-hub location problem
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Reliable facility location design under disruptions
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Q4472057
cites work: A compact linearisation of Euclidean single allocation hub location problems
cites work: Hub location problems in urban traffic networks
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
DOI: 10.1016/J.COR.2018.04.002
description: scientific article; zbMATH DE number 6901605