The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
From MaRDI portal
Publication:3505942
DOI10.1057/palgrave.jors.2602307zbMath1166.90355OpenAlexW1975324228MaRDI QIDQ3505942
John R. Current, Moon-Gil Yoon
Publication date: 11 June 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602307
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
A conditional \(p\)-hub location problem with attraction functions, Robust optimization approach to capacitated single and multiple allocation hub location problems, Multimodal freight transportation planning: a literature review, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Models and algorithms for network reduction, A branch-and-cut algorithm for the hub location and routing problem, An exact algorithm for the modular hub location problem with single assignments, Heuristics for the capacitated modular hub location problem, Hub Location as the Minimization of a Supermodular Set Function, Multiple allocation tree of hubs location problem for non-complete networks, A non-triangular hub location problem, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Allocation strategies in hub networks, Successive smoothing algorithm for solving large-scale optimization models with fixed cost, Multi-period hub network design problems with modular capacities, Proprietor and customer costs in the incomplete hub location-routing network topology, Branch-and-price-and-cut for a service network design and hub location problem, Flow shipment scheduling in an incomplete hub location-routing network design problem, A bi-objective incomplete hub location-routing problem with flow shipment scheduling
