A survey on benders decomposition applied to fixed-charge network design problems
2004; Elsevier BV; Volume: 32; Issue: 6 Linguagem: Inglês
10.1016/j.cor.2003.11.012
ISSN1873-765X
Autores Tópico(s)Transportation Planning and Optimization
ResumoNetwork 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.
Referência(s)