Steiner tree problems with profits. Costa, A., Cordeau, J., & Laporte, G. *INFOR*, 44(2):99-115, 2006.

Paper abstract bibtex

Paper abstract bibtex

This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when deciding which vertices should be spanned by the solution tree. The survey contains a classification of the problems falling within this category and an overview of the methods developed to solve them. It also lists several graph preprocessing procedures and analyzes their validity for the different variants of the problem. Finally, a brief comparison is made between the profit versions of the Steiner tree problem and of the travelling salesman problem.

@article{ title = {Steiner tree problems with profits}, type = {article}, year = {2006}, identifiers = {[object Object]}, keywords = {Steiner tree problem,Survey}, pages = {99-115}, volume = {44}, id = {bebcafa5-64e9-3016-bfc5-4ca704cca965}, created = {2019-08-17T08:16:53.255Z}, file_attached = {true}, profile_id = {db9868f5-9395-3b04-ab7d-553325a4e906}, last_modified = {2019-08-18T03:45:33.472Z}, read = {false}, starred = {false}, authored = {true}, confirmed = {true}, hidden = {false}, citation_key = {Costa2006}, private_publication = {false}, abstract = {This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when deciding which vertices should be spanned by the solution tree. The survey contains a classification of the problems falling within this category and an overview of the methods developed to solve them. It also lists several graph preprocessing procedures and analyzes their validity for the different variants of the problem. Finally, a brief comparison is made between the profit versions of the Steiner tree problem and of the travelling salesman problem.}, bibtype = {article}, author = {Costa, A.M. and Cordeau, J.-F. and Laporte, G.}, journal = {INFOR}, number = {2} }

Downloads: 0

{"_id":"NQ2ntCSnPK3gyGLDh","bibbaseid":"costa-cordeau-laporte-steinertreeproblemswithprofits-2006","downloads":0,"creationDate":"2016-10-02T06:31:59.309Z","title":"Steiner tree problems with profits","author_short":["Costa, A.","Cordeau, J.","Laporte, G."],"year":2006,"bibtype":"article","biburl":"https://blogs.unimelb.edu.au/alysson-costa/files/2019/08/AMC.bib","bibdata":{"title":"Steiner tree problems with profits","type":"article","year":"2006","identifiers":"[object Object]","keywords":"Steiner tree problem,Survey","pages":"99-115","volume":"44","id":"bebcafa5-64e9-3016-bfc5-4ca704cca965","created":"2019-08-17T08:16:53.255Z","file_attached":"true","profile_id":"db9868f5-9395-3b04-ab7d-553325a4e906","last_modified":"2019-08-18T03:45:33.472Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Costa2006","private_publication":false,"abstract":"This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when deciding which vertices should be spanned by the solution tree. The survey contains a classification of the problems falling within this category and an overview of the methods developed to solve them. It also lists several graph preprocessing procedures and analyzes their validity for the different variants of the problem. Finally, a brief comparison is made between the profit versions of the Steiner tree problem and of the travelling salesman problem.","bibtype":"article","author":"Costa, A.M. and Cordeau, J.-F. and Laporte, G.","journal":"INFOR","number":"2","bibtex":"@article{\n title = {Steiner tree problems with profits},\n type = {article},\n year = {2006},\n identifiers = {[object Object]},\n keywords = {Steiner tree problem,Survey},\n pages = {99-115},\n volume = {44},\n id = {bebcafa5-64e9-3016-bfc5-4ca704cca965},\n created = {2019-08-17T08:16:53.255Z},\n file_attached = {true},\n profile_id = {db9868f5-9395-3b04-ab7d-553325a4e906},\n last_modified = {2019-08-18T03:45:33.472Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Costa2006},\n private_publication = {false},\n abstract = {This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when deciding which vertices should be spanned by the solution tree. The survey contains a classification of the problems falling within this category and an overview of the methods developed to solve them. It also lists several graph preprocessing procedures and analyzes their validity for the different variants of the problem. Finally, a brief comparison is made between the profit versions of the Steiner tree problem and of the travelling salesman problem.},\n bibtype = {article},\n author = {Costa, A.M. and Cordeau, J.-F. and Laporte, G.},\n journal = {INFOR},\n number = {2}\n}","author_short":["Costa, A.","Cordeau, J.","Laporte, G."],"urls":{"Paper":"https://bibbase.org/service/mendeley/db9868f5-9395-3b04-ab7d-553325a4e906/file/79901fbc-2e22-e739-4f82-c6a463a41e4b/Costa_Cordeau_Laporte___2006.pdf.pdf"},"bibbaseid":"costa-cordeau-laporte-steinertreeproblemswithprofits-2006","role":"author","keyword":["Steiner tree problem","Survey"],"downloads":0},"search_terms":["steiner","tree","problems","profits","costa","cordeau","laporte"],"keywords":["network design","survey","budget","prize collecting","quota","reduction tests","steiner tree problem"],"authorIDs":[],"dataSources":["5cbKeTnq3KKaCpYuA"]}