A survey on benders decomposition applied to fixed-charge network design problems

Abstract

Network design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin-destination pair demands. Benders decomposition methods, based on the idea of partition and delayed constraint generation, have been successfully applied to many of these problems. This article presents a review of these applications. © 2003 Elsevier Ltd. All rights reserved.