Title of article
Prize collectingSteinertreeswithnodedegreedependentcosts$
Author/Authors
Lu?´s Gouveia ، نويسنده , , PedroMoura ، نويسنده , , AmarodeSousa ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
12
From page
234
To page
245
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
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927850
Link To Document