@article{costa08fast,
  title = {Fast Heuristics for the {{Steiner}} Tree Problem with Revenues, Budget and Hop Constraints},
  author = {Costa, A. M. and Cordeau, J.-F. and Laporte, G.},
  year = {2008},
  journal = {European Journal of Operational Research},
  volume = {190},
  pages = {68--78},
  issn = {0377-2217},
  doi = {10.1016/j.ejor.2007.06.012},
  urldate = {2021-05-12},
  abstract = {This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.},
  copyright = {All rights reserved},
  langid = {english},
  file = {/Users/acosta/Zotero/storage/4GH3NVBI/Costa et al. - 2008 - Fast heuristics for the Steiner tree problem with .pdf}
}

{"_id":"mhM9niPfFAbCTbyNw","bibbaseid":"costa-cordeau-laporte-fastheuristicsforthesteinertreeproblemwithrevenuesbudgetandhopconstraints-2008","downloads":1,"creationDate":"2016-10-02T06:31:59.307Z","title":"Fast Heuristics for the Steiner Tree Problem with Revenues, Budget and Hop Constraints","author_short":["Costa, A. M.","Cordeau, J.","Laporte, G."],"year":2008,"bibtype":"article","biburl":"https://www.dropbox.com/s/6qxz2tlaz2bi6av/costaam.bib?dl=1","bibdata":{"bibtype":"article","type":"article","title":"Fast Heuristics for the Steiner Tree Problem with Revenues, Budget and Hop Constraints","author":[{"propositions":[],"lastnames":["Costa"],"firstnames":["A.","M."],"suffixes":[]},{"propositions":[],"lastnames":["Cordeau"],"firstnames":["J.-F."],"suffixes":[]},{"propositions":[],"lastnames":["Laporte"],"firstnames":["G."],"suffixes":[]}],"year":"2008","journal":"European Journal of Operational Research","volume":"190","pages":"68–78","issn":"0377-2217","doi":"10.1016/j.ejor.2007.06.012","urldate":"2021-05-12","abstract":"This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.","copyright":"All rights reserved","langid":"english","file":"/Users/acosta/Zotero/storage/4GH3NVBI/Costa et al. - 2008 - Fast heuristics for the Steiner tree problem with .pdf","bibtex":"@article{costa08fast,\n title = {Fast Heuristics for the {{Steiner}} Tree Problem with Revenues, Budget and Hop Constraints},\n author = {Costa, A. M. and Cordeau, J.-F. and Laporte, G.},\n year = {2008},\n journal = {European Journal of Operational Research},\n volume = {190},\n pages = {68--78},\n issn = {0377-2217},\n doi = {10.1016/j.ejor.2007.06.012},\n urldate = {2021-05-12},\n abstract = {This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.},\n copyright = {All rights reserved},\n langid = {english},\n file = {/Users/acosta/Zotero/storage/4GH3NVBI/Costa et al. - 2008 - Fast heuristics for the Steiner tree problem with .pdf}\n}\n\n","author_short":["Costa, A. M.","Cordeau, J.","Laporte, G."],"key":"costa08fast","id":"costa08fast","bibbaseid":"costa-cordeau-laporte-fastheuristicsforthesteinertreeproblemwithrevenuesbudgetandhopconstraints-2008","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":1},"search_terms":["fast","heuristics","steiner","tree","problem","revenues","budget","hop","constraints","costa","cordeau","laporte"],"keywords":[],"authorIDs":["57f0a9df6ddb8f2379000012","57f0bb386cd76c007b000029","5d58bf4fc51e6cea0100006c","5de9e7949f521ddf010000e0","5df2d66679c00ade01000101","5df83eafa0ca62df01000005","5df925bbd04b27df01000076","5e0fc2fb2cfae9df0100000e","5e13fe38f8aa5dde01000097","5e1f18483cc57cde010000da","5e211465c63e88df010000e6","5e2a8c71881468de010000cc","5e2ee22e9033bede010000f4","5e38abc1645ed2de010000df","5e3d15467cb23fde010000a8","5e3d1ced7cb23fde01000101","5e3d334cc405ecde010000f8","5e411894b54187de01000032","5e4bc0afa6b53fde0100002a","5e5485a27f0f44de01000137","5e54bf64929495df01000155","5e578619cef9b7de0100005d","5e5f100a6ee7bddf01000124","5e60957e1fc211de010000c8","5e6196141d4ccede0100012c","5e6832489cef79de0100000e","Bp2p5Nmr4thBC3xzt","CSbYQFXuCHMwnk2Ko","HsEoRqQBNi9JbDp9j","JqMdiBj55fQALSjZK","LtBhooo7bupYh9xkW","PDaMkEXjXLAkkWipc","QYnFkD8B38c7fBxt3","SB6BC3sMGSACYgnbo","YhTuxHv2fJtt8KePD","aFfNGZNwixhGywjdD","cfRPTB26hyupTe794","fGbfn89MWG824o3uR","k7J7niW52BTMn82fq","nn925ZnshK43HGRA9","p2WuYZH3X9Li5YsA9","qsELJvkA9KFtsW5z2","roehyungMHG2AmCLG","sM5uc2aRoCSoyCFHD","wPJrNXPeRqDQZ9YbP"],"dataSources":["5cbKeTnq3KKaCpYuA","tNtM4BcgqDA3TAQJ2","C8ZTSgdcqKrDKQsFr","46LeTuyTYS9vH425i","ZBX5uo2BtG4uchtse","MrfAAeH3CCWrgiXCu"]}