Aarhus University Seal / Aarhus Universitets segl

A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  • Simon Görtz, Schumpeter School of Business and Economics, University of Wuppertal, Tyskland
  • Andreas Klose
This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. To guess a primal solution to the Lagrangean dual, we average solutions to the Lagrangean subproblem. Branching decisions are then based on this estimated (fractional) primal solution. Extensive numerical results reveal that the method is much faster and more robust than other state-of-the-art methods for solving the CFLP exactly.
OriginalsprogEngelsk
TidsskriftINFORMS Journal on Computing
Vol/bind24
Nummer4
Sider (fra-til)597-610
Antal sider14
ISSN1091-9856
DOI
StatusUdgivet - 2012

Se relationer på Aarhus Universitet Citationsformater

ID: 40207787