HUBBI: iterative network design for incomplete hub location problems
type: Item
instance of: scholarly article
title: HUBBI: iterative network design for incomplete hub location problems
zbMATH Open document ID: 1458.90425
author: Weibin Dai
author: Jun Zhang
author: Xiaoqian Sun
author: Sebastian Wandelt
published in: Computers \& Operations Research
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7023718
zbMATH Keywords: incomplete hub location problems
zbMATH Keywords: hubbiness
zbMATH Keywords: network design
zbMATH Keywords: scalability
MaRDI profile type: Publication
full work available at URL: j.cor.2018.09.011
OpenAlex ID: W2894758287
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: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
cites work: A new formulation and an exact approach for the many-to-many hub location-routing problem
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
cites work: Integer programming formulations of discrete hub location problems
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Branch and price for large-scale capacitated hub location problems with single assignment
cites work: Tight bounds from a path based formulation for the tree of hub location problem
cites work: The tree of hubs location problem
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: A two‐stage hub location method for air transportation in Brazil
cites work: Heuristics for the capacitated modular hub location problem
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Q3424618
cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Scatter search for an uncapacitated \(p\)-hub median problem
cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
cites work: Variable neighborhood search
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
cites work: Spatial analysis of single allocation hub location problems
cites work: Evolutionary Computation in Combinatorial Optimization
cites work: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
cites work: A branch-and-cut algorithm for the hub location and routing problem
cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines
cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem
cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
cites work: On tabu search for the location of interacting hub facilities
cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
cites work: Solving the hub location problem with modular link capacities
Wikidata QID: Q129142483
DOI: 10.1016/J.COR.2018.09.011
description: scientific article; zbMATH DE number 7023718