Lower bounding procedures for the single allocation hub location problem

DOI10.1016/j.endm.2016.03.010zbMath1351.90117OpenAlexW2399776165MaRDI QIDQ325391

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

Publication date: 18 October 2016

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

zbMATH Keywords

Lagrangian relaxationlower boundshub location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (4)

Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Stochastic single-allocation hub location ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels

Uses Software

• OR-Library

Cites Work

• 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
• Integer programming formulations of discrete hub location problems
• The Quadratic Assignment Problem
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Lower bounding procedures for the single allocation hub location problem