Lower Bounding Procedures for the Single Allocation Hub Location Problem

  • Christoph Buchheim
  • Uwe Clausen
  • J. Fabian Meier
  • Borzou Rostami
    • Categories 0-1 Programming, Graphs and Matroids, Production and Logistics Tags , , Short URL: https://optimization-online.org/?p=13177

    This paper proposes a new lower bounding procedure for the Uncapacitated Single Allocation p-Hub Median Problem based on Lagrangean relaxation. For solving the resulting Lagrangean subproblem, the given problem structure is exploited: it can be decomposed into smaller subproblems that can be solved efficiently by combinatorial algorithms. Our computational experiments for some benchmark instances demonstrate the strength of the new approach.

    Article

    Download

    View Lower Bounding Procedures for the Single Allocation Hub Location Problem