Enumeration and search procedures for a hub location problem with economies of scale

DOI10.1023/A:1020715517162zbMath1013.90078OpenAlexW17344140MaRDI QIDQ1872015

John G. Klincewicz

Publication date: 4 May 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020715517162

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (16)

Endogenous effects of hubbing on flow intensities ⋮ New complexity results for the \(p\)-hub median problem ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Supply chain design considering economies of scale and transport frequencies ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ Successive smoothing algorithm for solving large-scale optimization models with fixed cost ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Mileage bands in freight transportation ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Hub-and-spoke network design with congestion ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor

This page was built for publication: Enumeration and search procedures for a hub location problem with economies of scale