Lagrangian decompositions for the two-level FTTx network design problem

Balakrishnan, 1994, Modeling and heuristic worst-case performance analysis of the two-level network design problem, Manag Sci, 40, 846, 10.1287/mnsc.40.7.846

Bonnans JF, Gilbert JC, Lemaréchal C, Sagastizaábal CA (2003) Numerical optimization. Springer, New York

Chardy, 2012, Optimizing splitter and fiber location in a multilevel optical FTTH network, Eur J Oper Res, 222, 430, 10.1016/j.ejor.2012.05.024

Cherkassky, 1997, On implementing push-relabel method for the maximum flow problem, Algorithmica, 19, 390, 10.1007/PL00009180

Eisenbrand, 2010, Connected facility location via random facility sampling and core detouring, J Comput Syst Sci, 76, 709, 10.1016/j.jcss.2010.02.001

FTTx-Plan. FTTx-plan: Kostenoptimierte Planung von FTTx-Netzen. http://www.fttx-plan.de/

A. Goldberg (2012) Andrew Goldberg’s network optimization library. http://www.avglab.com/andrew/soft.html

Gollowitzer, 2011, MIP models for connected facility location: a theoretical and computational study, Comput Oper Res, 38, 435, 10.1016/j.cor.2010.07.002

Gollowitzer, 2013, Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities, Eur J Oper Res, 225, 211, 10.1016/j.ejor.2012.09.040

Grötschel M, Raack C, Werner A (2013) Towards optimizing the deployment of optical access networks. EURO J. Comput. Optim

Gualandi S, Malucelli F, Sozzi D.L. (2010a) On the design of the fiber to the home networks. In: Faigle U, Schrader R, Herrmann D, (eds) 9th CTW Workshop, Cologne, Germany, 2010. Extended Abstracts, pp 65–68

Gualandi S, Malucelli F, Sozzi DL (2010b) On the design of the next generation access networks. In: Lodi A, Milano M, Toth P (eds) CPAIOR 2010, Bologna, Italy, June 2010. Lecture notes in Computer Science, vol 6140. Springer, Berlin, pp 162–175

Helmberg C (2009) Network models with convex cost structure like bundle methods. In: Barnhart C, Clausen U, Lauther U, Möhring RH (eds) Models and algorithms for optimization in logistics, number 09261 in Dagstuhl seminar proceedings, Dagstuhl, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany

Helmberg C (2012) The conicbundle library for convex optimization. http://www-user.tu-chemnitz.de/helmberg/ConicBundle/

Helmberg, 2002, A spectral bundle method with bounds, Math Program, 93, 173, 10.1007/s101070100270

Hiriart-Urruty JB, Lemaréchal C (1993) Convex analysis and minimization algorithms. In: Volume 306 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin

Kim, 2011, A splitter locationallocation problem in designing fiber optic access networks, Eur J Oper Res, 210, 425, 10.1016/j.ejor.2010.10.003

Leitner, 2011, Branch-and-cut-and-price for capacitated connected facility location, J Math Model Algorithms, 10, 245, 10.1007/s10852-011-9153-5

Ljubić, 2006, An algorithmic framework for the eExact solution of the prize-collecting steiner tree problem, Math Program, 105, 427, 10.1007/s10107-005-0660-x

Ljubić, 2012, Exact approaches to the single-source network loading problem, Networks, 59, 89, 10.1002/net.20481

Martens M, Patzak E, Richter A, Wessäly R (2009) Werkzeuge zur Planung und Optimierung von FTTx-Netzen. In: 16. ITG-Fachtagung Kommunikationskabelnetze, Köln, Germany, vol 218, pp 37–41. VDE, Berlin

Martens M, Orlowski S, Werner A, Wessäly R, Bentz W (2010) FTTx-PLAN: optimierter aufbau von FTTx-Netzen. In: Breitbandversorgung in Deutschland, vol 220 of ITG-Fachbericht. VDE, Berlin

Mehlhorn, 1988, A faster approximation algorithm for the Steiner problem in graphs, Inform Process Lett, 27, 125, 10.1016/0020-0190(88)90066-X

Orlowski S, Werner A, Wessäly R, Eckel K, Seibel J, Patzak E, Louchet H, Bentz W (2011) Schätze heben bei der Planung von FTTx-Netzen: optimierte Nutzung von existierenden Leerrohren - eine Praxisstudie. In: Breitbandversorgung in Deutschland, vol 227 of ITG-Fachbericht. VDE, Berlin

Putz P (2012) Fiber to the home, cost optimal design of last-mile broadband telecommunication networks. PhD thesis, University of Vienna

Salman FS (2000) Selected problems in network design: exact and approximate solution methods. PhD thesis, Carnegie Mellon University, Pittsburgh