Brasil | Artículos de revistas

Accelerating benders decomposition with heuristicmaster problem solutions

dc.creatorCosta, Alysson M.
dc.creatorCordeau, Jean-François
dc.creatorGendron, Bernard
dc.creatorLaporte, Gilbert
dc.date.accessioned2013-11-04T12:21:40Z
dc.date.accessioned2018-07-04T16:34:10Z
dc.date.available2013-11-04T12:21:40Z
dc.date.available2018-07-04T16:34:10Z
dc.date.created2013-11-04T12:21:40Z
dc.date.issued2012
dc.identifierPesqui. Oper.,v.32,n.1,p.03-20,2012
dc.identifier0101-7438
dc.identifierhttp://www.producao.usp.br/handle/BDPI/38881
dc.identifier10.1590/S0101-74382012005000005
dc.identifierhttp://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100002&lng=en&nrm=iso&tlng=en
dc.identifierhttp://www.scielo.br/scielo.php?script=sci_abstract&pid=S0101-74382012000100002&lng=en&nrm=iso&tlng=en
dc.identifierhttp://www.scielo.br/scielo.php?script=sci_pdf&pid=S0101-74382012000100002&lng=en&nrm=iso&tlng=en
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1637374
dc.description.abstractIn this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.
dc.languageeng
dc.publisherSociedade Brasileira de Pesquisa Operacional
dc.relationPesquisa Operacional
dc.rightsopenAccess
dc.subjectBenders decomposition
dc.subjectextra cuts generation
dc.subjectmixed-integer programming
dc.titleAccelerating benders decomposition with heuristicmaster problem solutions
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución