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

By Alysson M. Costa. Computers & Operations Research, 2005

322 citations recorded by the source corpus.

Subfields: Building and Construction, Industrial and Manufacturing Engineering, Transportation

View Paper: https://www.semanticscholar.org/paper/ce319aea6c8e911769cfe4b2554fe5b37804c3cf

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Building and Construction

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Joe Naoum-Sawaya
4. Walter Rei
5. Ragheb Rahmaniani
6. Samir Elhedhli
7. Michael Drexl

In Industrial and Manufacturing Engineering

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Walter Rei
4. Ragheb Rahmaniani
5. Joe Naoum-Sawaya
6. Samir Elhedhli
7. Thibaut Vidal
8. Christian Prins

In Transportation

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Joe Naoum-Sawaya
4. Walter Rei
5. Ragheb Rahmaniani
6. Samir Elhedhli

Citations in the corpus

• An interior-point Benders based branch-and-cut algorithm for mixed integer programs (2010, methodology): “The resulting interior-point branch-and-cut method is tested on two classical problems from the literature that were previously solved using Benders decomposition: the capacitated facility location problem (Wentges 1996) and the multicommodity capacitated fixed charge network design problem (Costa 2”
• The Benders decomposition algorithm: A literature review (2017, methodology): “The now out-of-date survey by Costa (2005) reviews only applications to fixed-charge network design problems.”