ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
From MaRDI portal
Publication:3043676
DOI10.15807/jorsj.46.409zbMath1137.90590OpenAlexW2129157874MaRDI QIDQ3043676
Mihiro Sasaki, Masao Fukushima
Publication date: 6 August 2004
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.46.409
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
Robust optimization approach to capacitated single and multiple allocation hub location problems, A capacitated hub location problem under hose demand uncertainty, An exact algorithm for the modular hub location problem with single assignments, Heuristics for the capacitated modular hub location problem, Incremental optimization of hub and spoke network for the spokes' numbers and flow, Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm, Network hub location problems: The state of the art, Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system, Lagrangean relaxation for the capacitated hub location problem with single assignment
