W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

J. F. Tsai, M. H. Lin, and Y. C. Hu, "Finding multiple solutions to general integer linear programs," Eur. J. Oper. Res. 184, 802‒809 (2008).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP models based on flow aggregation," IEEE/ACM Trans. Netw. 15, (3), 709‒720 (2007).

[CrossRef]

H. Holler and S. Vob, "A heuristic approach for combined equipment-planning and routing in multilayer SDH/WDM networks," Eur. J. Oper. Res. 171, 787‒796 (2006).

[CrossRef]

T. Y. Chow and P. J. Lin, "The ring grooming problem," Networks 44, (3), 194‒202 (2004).

[CrossRef]

A. E. Ozdaglar and D. P. Bertsekas, "Routing and wavelength assignment in optical networks," IEEE/ACM Trans. Netw. 11, (2), 259‒272 (2003).

[CrossRef]

E. Modiano and P. J. Lin, "Traffic grooming in WDM networks," IEEE Commun. Mag. 9, (2), 124‒129 (2001).

[CrossRef]

R. M. Krishnaswamy and K. N. Sivarajan, "Design of logical lopologies: a linear formulation for wavelength-routed optical networks with no wavelength changers," IEEE/ACM Trans. Netw. 9, (2), 186‒198 (2001).

[CrossRef]

V. Gabrel, A. Knippel, and M. Minoux, "Exact solutions of multicommodity network optimization problems with general step cost function," Oper. Res. Lett. 25, 13‒23 (1999).

[CrossRef]

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.

F. Alvelos and J. M. Valerio de Carvalho, "Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem," Proc. INOC’03, 2003, pp. 7‒12.

A. E. Ozdaglar and D. P. Bertsekas, "Routing and wavelength assignment in optical networks," IEEE/ACM Trans. Netw. 11, (2), 259‒272 (2003).

[CrossRef]

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

T. Y. Chow and P. J. Lin, "The ring grooming problem," Networks 44, (3), 194‒202 (2004).

[CrossRef]

R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE J. Sel. Areas Commun. 20, (1), 110‒121 (2002).

[CrossRef]

V. Gabrel, A. Knippel, and M. Minoux, "Exact solutions of multicommodity network optimization problems with general step cost function," Oper. Res. Lett. 25, 13‒23 (1999).

[CrossRef]

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

H. Holler and S. Vob, "A heuristic approach for combined equipment-planning and routing in multilayer SDH/WDM networks," Eur. J. Oper. Res. 171, 787‒796 (2006).

[CrossRef]

J. F. Tsai, M. H. Lin, and Y. C. Hu, "Finding multiple solutions to general integer linear programs," Eur. J. Oper. Res. 184, 802‒809 (2008).

[CrossRef]

S. Ketabi and F. Salzborn, "Network optimization with piecewise linear convex costs," Proc. INOC’03, 2003, pp. 326‒330.

S. Ketabi, "The overflow model for network optimization problems with piecewise linear costs," Proc. INOC’03, 2003, pp. 323‒325.

V. Gabrel, A. Knippel, and M. Minoux, "Exact solutions of multicommodity network optimization problems with general step cost function," Oper. Res. Lett. 25, 13‒23 (1999).

[CrossRef]

R. M. Krishnaswamy and K. N. Sivarajan, "Design of logical lopologies: a linear formulation for wavelength-routed optical networks with no wavelength changers," IEEE/ACM Trans. Netw. 9, (2), 186‒198 (2001).

[CrossRef]

J. Q. Hu and B. Leida, "Traffic grooming, routing and wavelength assignment in optical WDM mesh networks," Proc. IEEE INFOCOM’04, 2004, pp. 495‒501.

W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

J. F. Tsai, M. H. Lin, and Y. C. Hu, "Finding multiple solutions to general integer linear programs," Eur. J. Oper. Res. 184, 802‒809 (2008).

[CrossRef]

T. Y. Chow and P. J. Lin, "The ring grooming problem," Networks 44, (3), 194‒202 (2004).

[CrossRef]

E. Modiano and P. J. Lin, "Traffic grooming in WDM networks," IEEE Commun. Mag. 9, (2), 124‒129 (2001).

[CrossRef]

H. Liu and F. A. Tobagi, "Traffic grooming in WDM SONET UPSR rings with multiple line speeds," Proc. IEEE INFOCOM’05, 2005, pp. 718‒729.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP models based on flow aggregation," IEEE/ACM Trans. Netw. 15, (3), 709‒720 (2007).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP based on source formulation," Proc. IEEE INFOCOM, 2004, pp. 1813‒1821.

M. Pioro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, 2004.

V. Gabrel, A. Knippel, and M. Minoux, "Exact solutions of multicommodity network optimization problems with general step cost function," Oper. Res. Lett. 25, 13‒23 (1999).

[CrossRef]

E. Modiano and P. J. Lin, "Traffic grooming in WDM networks," IEEE Commun. Mag. 9, (2), 124‒129 (2001).

[CrossRef]

B. Mukherjee, K. Zhu, and H. Zhu, Traffic Grooming in Optical WDM Mesh Networks, Springer, 2006.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.

A. E. Ozdaglar and D. P. Bertsekas, "Routing and wavelength assignment in optical networks," IEEE/ACM Trans. Netw. 11, (2), 259‒272 (2003).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP models based on flow aggregation," IEEE/ACM Trans. Netw. 15, (3), 709‒720 (2007).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP based on source formulation," Proc. IEEE INFOCOM, 2004, pp. 1813‒1821.

M. Pioro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, 2004.

X. Zhang and C. Qiao, "An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Trans. Netw. 8, (5), 608‒617 (2000).

[CrossRef]

W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE J. Sel. Areas Commun. 20, (1), 110‒121 (2002).

[CrossRef]

W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

S. Ketabi and F. Salzborn, "Network optimization with piecewise linear convex costs," Proc. INOC’03, 2003, pp. 326‒330.

R. M. Krishnaswamy and K. N. Sivarajan, "Design of logical lopologies: a linear formulation for wavelength-routed optical networks with no wavelength changers," IEEE/ACM Trans. Netw. 9, (2), 186‒198 (2001).

[CrossRef]

S. Thiagarajan and A. K. Somani, "A capacity correlation model for WDM networks with constrained grooming capabilities," Proc. IEEE ICC, 2001, pp. 1592‒1596.

S. Thiagarajan and A. K. Somani, "A capacity correlation model for WDM networks with constrained grooming capabilities," Proc. IEEE ICC, 2001, pp. 1592‒1596.

H. Liu and F. A. Tobagi, "Traffic grooming in WDM SONET UPSR rings with multiple line speeds," Proc. IEEE INFOCOM’05, 2005, pp. 718‒729.

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP models based on flow aggregation," IEEE/ACM Trans. Netw. 15, (3), 709‒720 (2007).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP based on source formulation," Proc. IEEE INFOCOM, 2004, pp. 1813‒1821.

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

J. F. Tsai, M. H. Lin, and Y. C. Hu, "Finding multiple solutions to general integer linear programs," Eur. J. Oper. Res. 184, 802‒809 (2008).

[CrossRef]

F. Alvelos and J. M. Valerio de Carvalho, "Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem," Proc. INOC’03, 2003, pp. 7‒12.

H. Holler and S. Vob, "A heuristic approach for combined equipment-planning and routing in multilayer SDH/WDM networks," Eur. J. Oper. Res. 171, 787‒796 (2006).

[CrossRef]

W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

X. Zhang and C. Qiao, "An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Trans. Netw. 8, (5), 608‒617 (2000).

[CrossRef]

B. Mukherjee, K. Zhu, and H. Zhu, Traffic Grooming in Optical WDM Mesh Networks, Springer, 2006.

B. Mukherjee, K. Zhu, and H. Zhu, Traffic Grooming in Optical WDM Mesh Networks, Springer, 2006.

H. Holler and S. Vob, "A heuristic approach for combined equipment-planning and routing in multilayer SDH/WDM networks," Eur. J. Oper. Res. 171, 787‒796 (2006).

[CrossRef]

J. F. Tsai, M. H. Lin, and Y. C. Hu, "Finding multiple solutions to general integer linear programs," Eur. J. Oper. Res. 184, 802‒809 (2008).

[CrossRef]

E. Modiano and P. J. Lin, "Traffic grooming in WDM networks," IEEE Commun. Mag. 9, (2), 124‒129 (2001).

[CrossRef]

R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE J. Sel. Areas Commun. 20, (1), 110‒121 (2002).

[CrossRef]

X. Zhang and C. Qiao, "An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Trans. Netw. 8, (5), 608‒617 (2000).

[CrossRef]

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP models based on flow aggregation," IEEE/ACM Trans. Netw. 15, (3), 709‒720 (2007).

[CrossRef]

R. M. Krishnaswamy and K. N. Sivarajan, "Design of logical lopologies: a linear formulation for wavelength-routed optical networks with no wavelength changers," IEEE/ACM Trans. Netw. 9, (2), 186‒198 (2001).

[CrossRef]

A. E. Ozdaglar and D. P. Bertsekas, "Routing and wavelength assignment in optical networks," IEEE/ACM Trans. Netw. 11, (2), 259‒272 (2003).

[CrossRef]

D. Bienstock, S. Chopra, O. Gunluk, and C. Y. Tsai, "Minimum cost capacity installation for multicommodity network flows," Math. Program. 81, 177‒199 (1998).

T. Y. Chow and P. J. Lin, "The ring grooming problem," Networks 44, (3), 194‒202 (2004).

[CrossRef]

V. Gabrel, A. Knippel, and M. Minoux, "Exact solutions of multicommodity network optimization problems with general step cost function," Oper. Res. Lett. 25, 13‒23 (1999).

[CrossRef]

W. Yao, G. Sahin, M. Li, and B. Ramamurthy, "Analysis of multi-hop traffic grooming in WDM mesh networks," Opt. Switching Netw. 6, 64‒75 (2009).

[CrossRef]

S. Thiagarajan and A. K. Somani, "A capacity correlation model for WDM networks with constrained grooming capabilities," Proc. IEEE ICC, 2001, pp. 1592‒1596.

M. Tornatore, G. Maier, and A. Pattavina, "WDM network optimization by ILP based on source formulation," Proc. IEEE INFOCOM, 2004, pp. 1813‒1821.

S. Ketabi and F. Salzborn, "Network optimization with piecewise linear convex costs," Proc. INOC’03, 2003, pp. 326‒330.

S. Ketabi, "The overflow model for network optimization problems with piecewise linear costs," Proc. INOC’03, 2003, pp. 323‒325.

J. Q. Hu and B. Leida, "Traffic grooming, routing and wavelength assignment in optical WDM mesh networks," Proc. IEEE INFOCOM’04, 2004, pp. 495‒501.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.

B. Mukherjee, K. Zhu, and H. Zhu, Traffic Grooming in Optical WDM Mesh Networks, Springer, 2006.

F. Alvelos and J. M. Valerio de Carvalho, "Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem," Proc. INOC’03, 2003, pp. 7‒12.

H. Liu and F. A. Tobagi, "Traffic grooming in WDM SONET UPSR rings with multiple line speeds," Proc. IEEE INFOCOM’05, 2005, pp. 718‒729.

M. Pioro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, 2004.