Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk. Lower bounds for two-period grooming via linear programming duality. Networks, 52(4):299-306, 2008. [doi]
No references recorded for this publication.
No citations of this publication recorded.