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

Alysson M. Costa

Published in: Comput. Oper. Res. (2005)

Keyphrases

network design problem
benders decomposition
network flow problem
network design
mixed integer
valid inequalities
branch and bound
minimal cost
approximation algorithms
mixed integer programming
exact algorithms
search algorithm
linear programming
integer programming
lagrangian relaxation
transportation networks