Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348467 | Computers & Operations Research | 2005 | 22 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alysson M. Costa,