Title of article :
Prize collectingSteinertreeswithnodedegreedependentcosts$
Author/Authors :
Lu?´s Gouveia ، نويسنده , , PedroMoura ، نويسنده , , AmarodeSousa ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
We discussavariantoftheprize-collectingSteinertreeproblemwithnodedegreedependentcosts
using atelecommunicationssettingtomotivatethesecosts.Wepresentandtestmodelswhichare
tailoredforthisvariantoftheproblem.Resultstakenfrominstanceswithupto100nodesareusedto
evaluatethequalityoftheproposedmodelsforsolvingtheproblem,aswellas,intermsofthe
correspondentlinearprogrammingrelaxation.
Keywords :
Steiner trees , Degree constraints , Valid inequalities , Reformulation
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
