A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
INFORMS Journal on Computing · 2012 · Volume 24 · Issue 4
Abstract
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.
Keywords
mixed-integer programming, Lagrangean relaxation, capacitated facility location, subgradient optimization, volume algorithm, branch and bound
Enable JavaScript for citation tools and additional paper interactions.