Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees

References

• Amiri A. The selection and scheduling of telecommunication calls with time windows. Eur. J. Oper. Res. (2005) 167(1):243–256Crossref, Google Scholar
• Amiri A, Barkhi R. The multi-hour bandwidth packing problem. Comput. Oper. Res. (2000) 27(1):1–14Crossref, Google Scholar
• Amiri A, Barkhi R. The combinatorial bandwidth packing problem. Eur. J. Oper. Res. (2011) 208(1):37–45Crossref, Google Scholar
• Amiri A, Rolland E, Barkhi R. Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. Eur. J. Oper. Res. (1999) 112(3):635–645Crossref, Google Scholar
• Anderson CA, Fraughnaugh K, Parker M, Ryan J. Path assignment for call routing: an application of tabu search. Ann. Oper. Res. (1993) 41(4):299–312Crossref, Google Scholar
• Barnhart C, Hane CA, Vance PH. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. (2000) 48(2):318–326Link, Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh GL, Vance PH. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
• Ben Amor H, Desrosiers J, Valerio de Carvalho JM. Dual-optimal inequalities for stabilized column generation. Oper. Res. (2006) 54(3):454–463Link, Google Scholar
• Bose I. Bandwidth packing with priority classes. Eur. J. Oper. Res. (2009) 192(1):313–325Crossref, Google Scholar
• Cox LA, Davis L, Qiu Y. Dynamic anticipatory routing in circuit-switched telecommunications networks. Handbook of Genetic Algorithms (1991) (Van Nostrand Reinhold, New York) 124–143Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM. Column Generation (2005) (Springer Verlag)1–358Crossref, Google Scholar
• Elhedhli S. Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. (2005) 33(6):615–624Crossref, Google Scholar
• Gavish B, Altinkemer K. Backbone network design tools with economic tradeoffs. INFORMS J. Comput. (1990) 2(3):236–252Link, Google Scholar
• Gavish B, Hantler S. An algorithm for optimal route selection in sna networks. IEEE T. Commun. (1983) 31(10):1154–1161Crossref, Google Scholar
• Geffard J. A solving method for singly routing traffic demand in telecommunication networks. Ann. Telecommun. (2001) 56(3):140–149Crossref, Google Scholar
• Kleinrock L. Communications Nets: Stochastic Message Flow and Delay (1964) (Dover, New York) Google Scholar
• Laguna M, Glover F. Bandwidth packing: A tabu search approach. Management Sci. (1993) 39(4):492–500Link, Google Scholar
• Lee C. Robust optimization models and algorithms for the problems in telecommunication and logistics. (2009) . PhD thesis, Korea Advanced Institute of Science and TechnologyGoogle Scholar
• Orlowski S, Wessaly R, Pioro M, Tomaszewski A. Sndlib 1.0—Survivable network design library. Networks (2010) 55(3):276–286Crossref, Google Scholar
• Park K, Kang S, Park S. An integer programming approach to the bandwidth packing problem. Management Sci. (1996) 42(9):1277–1291Link, Google Scholar
• Park S, Kim D, Lee K. An integer programming approach to the path selection problems. Internat. Network Optim. Conf. (2003) Evry/Paris, France:448–453Google Scholar
• Parker M, Ryan J. A column generation algorithm for bandwidth packing. Telecommun. Syst. (1993) 2(1):185–195Crossref, Google Scholar
• Rolland E, Amiri A, Barkhi R. Queueing delay guarantees in bandwidth packing. Comput. Oper. Res. (1999) 26(9):921–935Crossref, Google Scholar
• Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming (1999) 86(3):565–594Crossref, Google Scholar
• Villa C, Hoffman K. A column-generation and branch-and-cut approach to the bandwidth-packing problem. J. Res. NIST (2006) 111(2):161–185Crossref, Google Scholar