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]
@article{ColbournQS08,
title = {Lower bounds for two-period grooming via linear programming duality},
author = {Charles J. Colbourn and Gaetano Quattrocchi and Violet R. Syrotiuk},
year = {2008},
doi = {10.1002/net.20251},
url = {http://dx.doi.org/10.1002/net.20251},
tags = {programming},
researchr = {https://researchr.org/publication/ColbournQS08},
cites = {0},
citedby = {0},
journal = {Networks},
volume = {52},
number = {4},
pages = {299-306},
}