Branch and Price for WDM Optical Networks with No Bifurcation of Flow

References

• Banerjee D., Mukherjee B. Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Trans. Networking (2000) 8(5):598–607Crossref, Google Scholar
• Barnhart C., Hane C. A., Vance P. H. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. (2000) 48(2):318–326Link, Google Scholar
• Belotti P., Malucelli F. Row-column generation for multilayer network design. Proc. Second Internat. Network Optim. Conf. (2005) Lisbon, Portugal:422–427Google Scholar
• Chabrier A. Heuristic branch-and-price-and-cut to solve a network design problem. Fifth Internat. Workshop Integration AI OR Techniques Constraint Programming Combin. Optim. Problems (CP-AI-OR'03) (2003) MontréalGoogle Scholar
• Garg N., Vazirani V. V., Yannakakis M. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica (1997) 18(1):3–20Crossref, Google Scholar
• Haque A., Aneja Y. P., Bandyopadhyay S., Jaekel A., Sengupta A. Some studies on the logical topology design of large multi-hop optical networks. Optical Networks Magazine (2002) 3(4):96–105Google Scholar
• Hu J. Q., Leida B. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. Proc. 23rd Annual Joint Conf. IEEE Comput. Comm. Soc. (2004) 1(IEEE, Piscataway, NJ) 495–501Crossref, Google Scholar
• ILOG ILOG branch and price and cut shortest path optimizers prototype manual. (2003) . ILOG, Gentilly, FranceGoogle Scholar
• Koster A. M. C. A. Wavelength assignment in multi-fiber WDM networks by generalized edge coloring. (2005) . ZIB Report 05–13, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin. http://www.optimization-online.org/DB_FILE/2005/03/1096.pdfGoogle Scholar
• Koster A. M. C. A., Zymolka A. Provably good solutions for wavelength assignment in optical networks. Proc. Ninth Conf. Optical Network Design Modelling (2005) Milan:335–345Crossref, Google Scholar
• Lee K., Sudarsan L., Shayman M. Integrated logical topology design and traffic grooming in reconfigurable WDM networks. Proc. 37th Annual Conf. Inform. Sci. Systems (2003) BaltimoreGoogle Scholar
• Mukherjee B., Banerjee D., Ramamurthy S., Mukherjee A. Some principles for designing a wide-area WDM optical network. IEEE/ACM Trans. Networking (1996) 4(5):684–696Crossref, Google Scholar
• Prathombutr P., Stach J., Park E. K. An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. Telecomm. Systems (2005) 28(3–4):369–386Crossref, Google Scholar
• Raghavan S., Stanojević D. WDM optical network design using branch-and-price. (2006) . Working paper, University of Maryland, College Park. http://www.terpconnect.umd.edu/∼raghavan/WDMP1.pdfGoogle Scholar
• Ramaswami R., Sivarajan K.Optical Networks: A Practical Perspective (2002) 2nd ed.(Morgan Kaufmann, San Francisco) Google Scholar
• Ramaswami R., Sivarajan K. N. Design of logical topologies for wavelength-routed optical networks. IEEE J. Selected Areas Telecomm. (1996) 14(5):840–851Crossref, Google Scholar
• Stanojević D. Optimization of contemporary telecommunciations networks: Generalized minimum spanning trees and WDM optical networks. (2005) . Ph.D. thesis, University of Maryland, College ParkGoogle Scholar
• Sung C. S., Song S. H. Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network. J. Oper. Res. Soc. (2003) 54(1):72–82Crossref, Google Scholar
• Zhu K., Mukherjee B. Traffic grooming in an optical WDM mesh network. IEEE J. Selected Areas Comm. (2002) 20(1):122–133Crossref, Google Scholar