Length-bounded cuts and flows, ACM Transactions on Algorithms, vol.7, issue.1, 2010. ,
Partitioning procedures for solving mixed-variables programming problems, Numerische mathematik, vol.4, issue.1, pp.238-252, 1962. ,
Programming with linear fractional functionals, Naval research logistics quarterly, vol.9, issue.3-4, pp.181-186, 1962. ,
A survey on benders decomposition applied to fixed-charge network design problems, Computers & operations research, vol.32, issue.6, pp.1429-1450, 2005. ,
Benders, metric and cutset inequalities for multicommodity capacitated network design, Computational Optimization and Applications, vol.42, issue.3, pp.371-392, 2009. ,
Benders decomposition approach for the robust network design problem with flow bifurcations, Networks, vol.62, issue.1, pp.1-16, 2013. ,
Exact approaches to the single-source network loading problem, Networks, vol.59, issue.1, pp.89-106, 2012. ,
Modeling and solving the two-facility capacitated network loading problem, Operations Research, vol.43, issue.1, pp.142-157, 1995. ,
Accelerating benders decomposition: Algorithmic enhancement and model selection criteria, Operations research, vol.29, issue.3, pp.464-484, 1981. ,
Cutting plane methods and subgradient methods, Tutorials in Operations Research, pp.34-61, 2009. ,
In-out separation and column generation stabilization by dual price smoothing, 12th International Symposium on Experimental Algorithms, pp.354-365, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00750412
Ray projection for optimizing polytopes with prohibitively many constraints in setcovering column generation, Mathematical Programming, vol.155, issue.1, pp.147-197, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-02469699
The benders decomposition algorithm: A literature review, European Journal of Operational Research, vol.259, issue.3, pp.801-817, 2017. ,
Benders-and-cut algorithm for fixed-charge capacitated network design problem, European Journal of Operational Research, vol.125, issue.3, pp.622-632, 2000. ,