%0 Journal Article
%T Projeto de rede com custos convexos e balanceamento de fluxos
%A Dias
%A Pollyanna G. Faria
%A Miranda Jr.
%A Gilberto de
%A Saldanha
%A Rodney Rezende
%A Camargo
%A Ricardo Saraiva de
%J Sba: Controle & Automa£¿£¿o Sociedade Brasileira de Automatica
%D 2012
%I Sociedade Brasileira de Autom¨¢tica
%R 10.1590/S0103-17592012000100005
%X in this work, the single source tree network design problem under convex costs is addressed. this is a referential problem when designing networks for materials, energy or data transportation. the modeling effort yields a large scale mixed-integer nonlinear program which is very hard to solve. in order to overcome the solution difficulties, two distinct solution methods are deployed: the first of them is the generalized benders decomposition method; the second technique combines the outer approximation method with the ideas of projection in benders decomposition in order to imply the technique hybrid-oa. the hybrid-oa method is very effective on solving instances up to 702 edges, under reasonable computational costs, and makes the further application of the proposed technique to even more sophisticated models promising.
%K network design problems
%K benders decomposition
%K outer approximation.
%U http://www.scielo.br/scielo.php?script=sci_abstract&pid=S0103-17592012000100005&lng=en&nrm=iso&tlng=en