Solving the Capacitated Local Access Network Design Problem

References

• Achim C., Florian M., Robillard P.Experiments in Solving Concave Cost Network Flow Problems (1975) (Department d'informatique, Université de Montréal, Montréal) Google Scholar
• Amiri A., Pirkul H. Routing and capacity assignment in backbone communication networks. Comput. Oper. Res. (1997) 24:175–287Crossref, Google Scholar
• Andrew A. M. Another efficient algorithm for convex hulls in two dimensions. Inform. Processing Lett. (1979) 9:216–219Crossref, Google Scholar
• Atamtürk A. On capacitated network design cut-set polyhedra. Math. Programming (2002) 92:425–437Crossref, Google Scholar
• Atamtürk A., Rajan D. On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Programming (2002) 92:315–333Crossref, Google Scholar
• Awerbuch B., Azar Y. Buy-at-bulk network design. Proc. 38th Annual Sympos. Foundations Comput. Society (FOCS) (1997) Miami Beach, FL:542–547Crossref, Google Scholar
• Barahona F. Network design using cut inequalities. SIAM J. Optim. (1996) 6:823–837Crossref, Google Scholar
• Berger D., Gendron B., Potvin J., Raghavan S., Soriano P. Tabu search for a network loading problem with multiple facilities. J. Heuristics (2000) 6:253–267Crossref, Google Scholar
• Bienstock D., Günlük O. Computational experience with a difficult multicommodity flow problem. Math. Programming (1995) 11:213–237Crossref, Google Scholar
• Bienstock D., Günlük O. Capacitated network design—Polyhedral structure and computation. INFORMS J. Comput. (1996) 8:243–259Link, Google Scholar
• Bienstock D., Chopra S., Günlük O., Tsai C.-Y. Minimum cost capacity installation for multicommodity network flows. Math. Programming (1998) 81:177–199Crossref, Google Scholar
• Chopra S., Gilboa I., Sastry S. T. Source sink flows with capacity installation in batches. Discrete Appl. Math. (1998) 85:165–192Crossref, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Management Sci. (2003) 49:1268–1273Link, Google Scholar
• Edmonds J., Karp R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (1972) 19(2):248–264Crossref, Google Scholar
• Gabrel V., Knippel A. Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. (1999) 25:15–23Crossref, Google Scholar
• Gabrel V., Knippel A., Minoux M. A comparison of heuristics for the discrete cost multicommodity network optimization problem. J. Heuristics (2003) 9(5):429–445Crossref, Google Scholar
• Gavish B., Altinkemer K. Backbone network design tools with economic tradeoffs. ORSA J. Comput. (1990) 2:236–252Link, Google Scholar
• Guha S., Meyerson A., Munagala K. A constant factor approximation for the single sink edge installation problems. Proc. ACM Sympos. Theory Comput. (2001) Heraklion, Crete, Greece:383–388Crossref, Google Scholar
• Gupta A., Kumar A., Roughgarden T. Simpler and better approximation algorithms for network design. Proc. ACM Sympos. Theory Comput. (2003) San Diego:365–372Crossref, Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley & Sons, New York) Crossref, Google Scholar
• Keha A. B., de Farias I. R., Nemhauser G. L. Models for representing piecewise linear cost functions. Oper. Res. Lett. (2004) 32:44–48Crossref, Google Scholar
• Magnanti T. L., Mirchandani P. Shortest paths, single origin-destination network design and associated polyhedra. Networks (1993) 23:103–121Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. The convex hull of two core capacitated network design problems. Math. Programming: Ser. A (1993) 60:233–250Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. (1995) 43:142–157Link, Google Scholar
• Mirchandani P. Projections of the capacitated network loading problem. Eur. J. Oper. Res. (2000) 122:534–560Crossref, Google Scholar
• Ottosson G., Thorsteinsson E., Hooker J. N. Mixed global constraints and inference in hybrid CLP-IP solvers. Ann. Math. AI (2002) 34:271–290Google Scholar
• Raghavan S., Stanojevic D., Raghavan S., Anandalingam G. A note on search by objective relaxation. Telecommunications Planning: Innovations in Pricing, Network Design and Management (2005) (Springer, New York) 181–202Google Scholar
• Réfalo P., Jaffar J. Tight cooperation and its application in piecewise linear optimization. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science (1999) 1713(Springer, Berlin) 373–389Crossref, Google Scholar
• Salman F. S., Cheriyan J., Ravi R., Subramanian S. Buy-at-bulk network design: Approximating the single-sink edge installation problem. Proc. ACM-SIAM Sympos. Discrete Algorithms (1997) New Orleans:619–628Google Scholar
• Salman F. S., Cheriyan J., Ravi R., Subramanian S. Approximating the single-sink link-installation problem in network design. SIAM J. Optim. (2000) 11:595–610Crossref, Google Scholar
• Stoer M., Dahl G. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik (1994) 68:149–167Crossref, Google Scholar
• Talwar K. The single-sink buy-at-bulk LP has constant integrality gap. Proc. Conf. Integer Programming and Combin. Optim., Lecture Notes in Computer Science (2002) 2337(Cambridge, MA)475–486Crossref, Google Scholar