A compact linearisation of Euclidean single allocation hub location problems

DOI10.1016/j.endm.2016.03.006zbMath1351.90053OpenAlexW2394909738MaRDI QIDQ325380

J. Fabian Meier, Uwe Clausen, Borzou Rostami, Christoph Buchheim

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.006

zbMATH Keywords

Euclidean distancehub locationrow generation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (5)

Reliable single allocation hub location problem under hub breakdowns ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Stochastic single-allocation hub location ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels

Uses Software

• OR-Library

Cites Work

• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

This page was built for publication: A compact linearisation of Euclidean single allocation hub location problems