SciELO - Scientific Electronic Library Online

SciELO - Scientific Electronic Library Online

Article References

COSTA, Alysson M.; CORDEAU, Jean-François; GENDRON, Bernard  and  LAPORTE, Gilbert. Accelerating benders decomposition with heuristicmaster problem solutions. Pesqui. Oper. [online]. 2012, vol.32, n.1, pp. 03-20.  Epub Mar 08, 2012. ISSN 0101-7438.  http://dx.doi.org/10.1590/S0101-74382012005000005.

    1. BANSAL N, GUPTA A, LI J, MESTRE J, NAGARAJAN V & RUDRA A. 2010. When LP is the cure for your matching woes: improved bounds for stochastic matchings. In: BERG M & MEYER U (Eds.), Lecture Notes in Computer Science (Vol. 6347, pp. 218-229). Berlin, Heidelberg: Springer, Berlin and Heidelberg. [ Links ]

    2. BENDERS JF. 1962. Partitioning procedures for solving mixed-variables programming problems.Numerische Mathematik, 4: 238–252. [ Links ]

    3. BYRKA J, SRINIVASAN A & SWAMY C. 2010. Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. In: F. Eisenbrand & F.B. Shepherd (Eds.), Lecture Notes in Computer Science (Vol. 6080, pp. 244-257). Berlin, Heidelberg: Springer, Berlin and Heidelberg. [ Links ]

    4. COSTA AM. 2005. A survey on benders decomposition applied to fixed-charge network design problems. Computers & Operations Research, 32: 1429–1450. [ Links ]

    5. COSTA AM, CORDEAU J-F & GENDRON B. 2009. Benders, metric and cutset inequalities for multi-commodity capacitated network design. Computational Optimization and Applications, 42: 371–392. [ Links ]

    6. CRAINIC TG, GENDRON B & HERNU G. 2004. A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics, 10: 525–545. [ Links ]

    7. GENDRON B, POTVIN J-Y & SORIANO P. 2003. A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Annals of Operations Research, 122: 193–217. [ Links ]

    8. GHAMLOUCHE I, CRAINIC TG & GENDREAU M. 2004. Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Annals of Operations Research, 131: 109–133. [ Links ]

    9. GLOVER F. 1989a. Tabu search – Part I. ORSA Journal on Computing, 1: 190–206. [ Links ]

    10. GLOVER F. 1989b. Tabu search – Part II. ORSA Journal on Computing, 2: 4–32. [ Links ]

    11. KIM D & PARDALOS PM. 1999. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Operations Research Letters, 24: 195–203. [ Links ]

    12. KIRKPATRICK S. 1984. Optimization by simulated annealing: quantitative studies. Journal of Statistical Physics, 34: 975–986. [ Links ]

    13. MAGNANTI T & WONG R. 1981. Accelerating Benders decomposition: algorithmic enhacement and model selection criteria. Operations Research, 23: 464–484. [ Links ]

    14. MCDANIEL D & DEVINE M. 1977. A modified Benders' partitioning algorithm for mixed integer programming. Management Science, 24: 312–319. [ Links ]

    15. MLADENOVIC N & HANSEN P. 1997. Variable neighborhood search. Computers & Operations Research, 24: 1097–1100. [ Links ]

    16. PAPADAKOS N. 2008. Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36: 444–449. [ Links ]

    17. REI W, CORDEAU J-F, GENDREAU M & SORIANO P. 2008. Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, 21: 333–345. [ Links ]

    18. THANH PN, BOSTEL N & PÉTON O. 2012. A DC programming heuristic applied to the logistics network design problem. International Journal of Production Economics, 135: 94–105. [ Links ]

    19. WENTGES P. 1996. Accelerating Benders' decomposition for the capacitated facility location problem. Mathematical Models of Operations Research, 44: 267–290. [ Links ]