Lower bounds for two-period grooming via linear programming duality
From MaRDI portal
Publication:3548731
DOI10.1002/net.20251zbMath1159.90325MaRDI QIDQ3548731
Violet R. Syrotiuk, Charles J. Colbourn, Gaetano Quattrocchi
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20251
optical networks; graph decomposition; combinatorial designs; traffic grooming; linear programming duality
90C10: Integer programming
90C05: Linear programming
90B15: Stochastic network models in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Embedding path designs in 4-cycle systems
- Grooming in unidirectional rings: \(K_{4}-e\) designs
- Grooming for two-period optical networks
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6