Lower bounds for two-period grooming via linear programming duality

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]

Authors

Charles J. Colbourn

This author has not been identified. Look up 'Charles J. Colbourn' in Google

Gaetano Quattrocchi

This author has not been identified. Look up 'Gaetano Quattrocchi' in Google

Violet R. Syrotiuk

This author has not been identified. Look up 'Violet R. Syrotiuk' in Google