Combined network design and multiperiod pricing: Modeling, solution techniques, and computation

Operations Research

Volumn 54, Issue 2, 2006, Pages 261-276

  Bienstock, Daniel ^a   Raskina, Olga ^b   Saniee, Iraj ^c   Wang, Qiong ^c  

^a Columbia University ^*  (United States)

^b Emptoris Inc   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Communications; Facility equipment planning: capacity expansion, design, maintenance replacement; Programming: nonlinear

Indexed keywords

CAPACITY DEPLOYMENT COSTS; FACILITY/EQUIPMENT PLANNING: CAPACITY EXPANSION, DESIGN, MAINTENANCE/REPLACEMENT; MULTIPERIOD CAPACITY EXPANSION; PROGRAMMING: NONLINEAR; TRANSMISSION TECHNOLOGY;

ALGORITHMS; BANDWIDTH; COMMUNICATION SYSTEMS; DECOMPOSITION; OPTICAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTER NETWORKS;

EID: 33645555153     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1050.0259     Document Type: Article

References (30)

1. Alevras, D., M. Grötschel, R. Wessäly. 1997. Capacity and survivability models for telecommunication networks. Proc. Euro/INFORMS Meeting, Barcelona, Spain, 187-199.
2. Alevras, D., M. Grötschel, R. Wessäly. 1998. Cost-efficient network synthesis from leased lines. Ann. Oper. Res. 76 1-20.
3. Balakrishnan, A., T. L. Magnanti, R. T. Wong. 1995. A decomposition algorithm for local access telecommunications network expansion planning. Oper. Res. 43 58-76.
4. Bienstock, D. 1996. Computational study of a family of mixed-integer quadratic programming problems. Math. Programming 74 121-140.
5. Bienstock, D., O. Günlük. 1996. Capacity expansion in networks - New inequalities and computation. ORSA J. Comput. 8 243-260.
6. Bienstock, D., G. Muratore. 2000. Strong inequalities for capacitated survivable network design problems. Math. Programming 89(1, Ser. A) 127-147.
7. Bienstock, D., I. Saniee. 2001. ATM network design: Traffic models and optimization-based heuristics. Telecomm. Systems 16 399-421.
8. Bienstock, D., O. Günlük, S. Chopra, C. Y. Tsai. 1998. Minimum cost capacity installation for multicommodity flows. Math. Programming 81 177-199.
9. Bley, A., M. Grötschel, R. Wessäly. 2000. Design of broadband virtual private networks: Model and heuristic for the B-WiN. Robust Communication Networks: Interconnection and Survivability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 53. American Mathematical Society, Providence, RI, 1-16.
10. Chen, X., D. Simchi-Levi. 2002. Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finitie horizon case. MIT OR Center technical memorandum, Massachusetts Institute of Technology, Cambridge, MA.
11. CLAPACK Library, www.netlib.org/clapack.
12. CPLEX Reference Manual. 1999. ILOG CPLEX 7.5. ILOG, Inc., Incline Village, NV.
13. Davis, R. D., K. Kumaran, G. Liu, I. Saniee. 2001. SPIDER: A simple and flexible tool for design and provisioning of protected lightpaths in optical networks. Bell Labs Tech. J. 6(1) 82-97.
14. Dixit, A., R. Pindyck. 1994. Investment Under Uncertainty. Princeton University Press, Princeton, NJ.
15. Federgruen, A., A. Heching. 1999. Combined pricing and inventory control under uncertainty. Oper. Res. 47 454-475.
16. Fiacco, A. V., G. P. McCormick. 1968. Nonlinear Programming: Sequential Unconstrained Optimization Techniques. Wiley, New York.
17. Gill, P., W. Murray, M. Saunders. 1997. User's guide for SNOPT 5.3. Stanford Business Software, Inc., Mountain View, CA.
18. Gill, P., W. Murray, M. H. Wright. 1991. Numerical Linear Algebra and Optimization. Addison-Wesley Publishing Company, Boston, MA.
19. Günlük, O. 1999. A branch-and-cut algorithm for capacitated network design. Math. Programming 86 17-39.
20. Günlük, O., B. Brockmüller, L. Wolsey. 1996. Designing private line networks - Polyhedral analysis and computation. Technical report CORE 9647, Center for Operations Research and Econometrics, Louvain-la-Neuve, Belgium.
21. Lanning, S. G., D. Mitra, Q. Wang, M. H. Wright. 2000. Optimal planning for optical transport networks. Philos. Trans. Roy. Soc. London A 358(1773) 2183-2196.
22. Lisser, A., A. Ouorou, J.-Ph. Vial, J. Gondzio. 1999. Capacity planning under uncertain demand in telecommunications networks. Logilab technical report, Department of Management Studies, University of Geneva, Geneva, Switzerland.
23. Luenberger, D. 1989. Introduction to Linear and Nonlinear Programming. Addison-Wesley Publishing Company, Boston, MA.
24. Magnanti, T. L., P. Mirchandani, R. Vachani. 1995. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43 142-157.
25. Raskina, O. 2003. Two large-scale network design problems. Ph.D. thesis, Columbia University, New York.
26. Saniee, I. 1996. Optimal routing design in self-healing communications networks. Internat. Trans. Oper. Res. 3(2) 187-195.
27. Schrijver, A. 1999. Theory of Linear and Integer Programming. Wiley-Interscience, New York.
28. Sen, S., R. Doverspike, S. Cosares. 1994. Network planning with random demand. Telecomm. Systems 3 11-30.
29. Stoer, M., G. Dahl. 1994. A polyhedral approach to multicommodity survivable network design. Numerische Math. 68 149-167.
30. Vanderbei, R. 1997. LOQO User's manual. Statistics and operations research. Technical report SOR-97-08, Princeton University, Princeton, NJ.