Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

摘要

Highlights ? We consider the single and multi-depot capacitated ring-star problem. ? The problem arises in telecommunication networks design and trans portation planning. ? We investigate new pricing strategies for computing tight lower bounds. ? We prove the effectiveness of the lower bounds through computational results. Abstract The Capacitated m-Ring-Star Problem (crsp) is the problem of designing a set of rings that