| Article ID: | iaor2006960 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 1429 |
| End Page Number: | 1450 |
| Publication Date: | Jun 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Costa Alysson M. |
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.