71 Hits in 10.5 sec

Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion [article]

Tobias Müller, Kyrill Schmid, Daniëlle Schuman, Thomas Gabor, Markus Friedrich, Marc Geitz
2021 arXiv   pre-print
The expansion of Fiber-To-The-Home (FTTH) networks creates high costs due to expensive excavation procedures.  ...  Mathematically, the FTTH network problem can be described as a minimum Steiner Tree problem.  ...  ACKNOWLEDGEMENTS The authors would like to thank Deutsche Telekom Laboratories (T-Labs) for funding this work.  ... 
arXiv:2109.10617v2 fatcat:rhrfw3xmwrhmdalwtn2hlcgy2e

Towards optimizing the deployment of optical access networks

Martin Grötschel, Christian Raack, Axel Werner
2013 EURO Journal on Computational Optimization  
In this paper we study the cost-optimal deployment of optical access networks considering variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to the curb (FTTC  ...  We identify the combinatorial structures of the most important sub-problems arising in this area and model these, e.g., as capacitated facility location, concentrator location, or Steiner tree problems  ...  For fruitful discussions and comments improving this work, the authors thank Roland Wessäly, Sebastian Orlowski, and Andreas Bley, as well as the reviewers for corrections and valuable suggestions for  ... 
doi:10.1007/s13675-013-0016-x fatcat:dqpaylwk4jb7lftidsxwzecpzu

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks [chapter]

Markus Leitner, Günther R. Raidl
2008 Lecture Notes in Computer Science  
We consider a generalization of the (Price Collecting) Steiner Tree Problem on a graph with special redundancy requirements for customer nodes.  ...  The problem occurs in the design of the last mile of real-world communication networks.  ...  Introduction We consider a real-world communication network design problem arising in the expansion of existing fiber optic networks.  ... 
doi:10.1007/978-3-540-88439-2_12 fatcat:apkl4qvs5vgkhkxktykeddeyny

Networks, uncertainty, applications and a crusade for optimality

Eduardo Álvarez-Miranda
2015 4OR  
In the context of the expansion of fiber optic networks mentioned above, graph G = (V, E) is the potential network for which we want to find an expansion plan, so edges e ∈ E are the possible links with  ...  The Prize-Collecting Steiner Tree Model In [Dittrich et al., 2008] the authors observed that the MWCS on undirected graphs is equivalent to the Prize-Collecting Steiner Tree Problem (PCStT), in the sense  ...  For the B-RMWCS, for a given instance I with set of terminals R, let Ĉmin be the cost of the minimum Steiner Tree on R with arc costs ĉij = c j .  ... 
doi:10.1007/s10288-015-0281-z fatcat:vpvyyvyj3nax3jjg5gqx3il44q

Spatial networks

Marc Barthélemy
2011 Physics reports  
An important consequence of space on networks is that there is a cost associated to the length of edges which in turn has dramatic effects on the topological structure of these networks.  ...  Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields ranging from urbanism to epidemiology.  ...  Acknowledgements I am indebted to A. Banos, A. Barrat  ... 
doi:10.1016/j.physrep.2010.11.002 fatcat:mp77spbw2jewvijlttu7y3bktq

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
The problem is framed as a multi-indicator assessment and is solved using a minimal cost objective.  ...  problem (finding the efficient tours made up of the efficient paths).  ...  This paper addresses a way to solve large-scaled mixed-integer problems of network expansion planning applying benders decomposition.  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Towards a unified territorial design approach — Applications, algorithms and GIS integration

Jörg Kalcsics, Stefan Nickel, Michael Schröder
2005 TOP - An Official Journal of the Spanish Society of Statistics and Operations Research  
We present computational results indicating the efficiency and suitability of the latter method for solving large-scale practical problems in an interactive environment.  ...  We will present computational results indicating the efficiency and suitability of this method for solving large-scale practical problems in an interactive environment.  ...  , like network flow methods, which are suitable for solving large scale problems.  ... 
doi:10.1007/bf02578982 fatcat:yji7qc25yngvjcm23l7p4skuxy

A Survey of Big Data Machine Learning Applications Optimization in Cloud Data Centers and Networks [article]

Sanaa Hamid Mohamed, Taisir E.H. El-Gorashi, Jaafar M.H. Elmirghani
2019 arXiv   pre-print
Wide ranging efforts were devoted to optimize systems that handle big data in terms of various applications performance metrics and/or infrastructure energy efficiency.  ...  This survey article reviews the challenges associated with deploying and optimizing big data applications and machine learning algorithms in cloud data centers and networks.  ...  All data are provided in full in the results section of this paper.  ... 
arXiv:1910.00731v1 fatcat:kvi3br4iwzg3bi7fifpgyly7m4

Toward virtual biopsy through an all fiber optic ultrasonic miniaturized transducer: a proposal

A. Acquafresca, E. Biagi, L. Masotti, D. Menichelli
2003 IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control  
theory ............Bipartite graph ............Optimal matching ............Reachability analysis ............Shortest path problem ............Tree graphs ........Steiner trees ....Computational efficiency  ...  theory ........Bipartite graph ........Optimal matching ........Reachability analysis ........Shortest path problem ........Tree graphs ....Harmonic analysis ....Iterative methods ........Expectation-maximization  ... 
doi:10.1109/tuffc.2003.1244749 fatcat:l3jre4etsvcqzfyz2jqggji3gy

Mixed integer programming approaches to problems combining network design and facility location

Stefan Gollowitzer
2012 unpublished
In this thesis we propose mathematical optimization models for the cost-efficient design of local access networks based on fiber-optic cable.  ...  links and facilities for Fiber-to-the-Curb networks.  ...  Acknowledgements The authors thank to Markus Chimani for the proof of Lemma 8b. Bibliography [1] IBM CPLEX. URL  ... 
doi:10.25365/thesis.24377 fatcat:ahaldmyb45gh7cuuqatamnndxm

Dispersion [chapter]

2008 Business Site Selection, Location Analysis and GIS  
Tree-based facility Locate a tree structure (continuous space or network) to maximally connect and minimize cost (e.g., Steiner tree).  ...  The Dijkstra algorithm is known as a labeling approach and can be easily programmed to solve problems on large networks.  ...  Weiszfeld algorithm Iterative solution technique for solving the Weber problem (single-facility Euclidean distance location problem).  ... 
doi:10.1002/9780470432761.ch10 fatcat:e7r5a7g5ybhpzbgx6xjav2wrzq

Cities and Biodiversity Outlook: Action and Policy

Kathryn Campbell, Lena Chan, Julien Custot, Thomas Elmqvist, Russell Galt, Madhusudan Katti, Andre Mader, Ana Persic, Jose Puppim De Oliveira, Andrew Rudd
2012 Figshare  
The citation format for this publication is as follows: Secretariat of the Convention on Biological Diversity (2012) Cities and Biodiversity Outlook.  ...  The designations employed and the presentation of material in Cities and Biodiversity Outlook do not imply the expression of any opinion whatsoever on the part of the Secretariat of the Convention on Biological  ...  Asia Asia is home to 60 percent of the world's population, and there are large variations in the region with regard to urbanization levels and urban growth rates.  ... 
doi:10.6084/m9.figshare.99889.v1 fatcat:63h2neh6xjclxdxiia3rfzq6vm

Proceedings of The International Research Education & Training Center [article]

Namig Isazade
2021 Zenodo  
Proceedings of The International Research Education & Training Center  ...  [9] , with the Genetic algorithm (GA), the part support structure with a low volume truss system was optimized to find a solution to the Direct Steiner Tree (DST) problem.  ...  to set the problem, to solve it and to make of decision [10] .  ... 
doi:10.5281/zenodo.5502124 fatcat:j5vvdb3j5nemvpo4splz4n7ziq

Network flows and network design in theory and practice [article]

Jannik Matuschke, Technische Universität Berlin, Technische Universität Berlin, Martin Skutella, Britta Peis
We show that the presence of this axiom alone suffices to ensure max flow/min cut properties in the time expansion of the system.  ...  We complement our model by providing various heuristic approaches and mixed integer programming formulations for solving the resulting optimization problem.  ...  In these so-called fiber-to-the-home or fiber-to-the-curb networks, optical splitters are used to split a single fiber emanating from the central office into a fiber tree serving multiple clients.  ... 
doi:10.14279/depositonce-3968 fatcat:y5jued6ernc4hmh2ftc2acec4a

The History of Communications and its Implications for the Internet

Andrew Odlyzko
2000 Social Science Research Network  
Historical evidence suggests that when service costs decrease, such arguments prevail over the need to operate a network at high utilization levels and to extract the highest possible revenues.  ...  Price and quality differentiation are valuable tools that can provide higher revenues and increase utilization efficiency of a network, and thus in general increase social welfare.  ...  This in turn led to intensive mathematical investigations of the Steiner tree problem and related questions. Today, in a competitive market, two conflicting tendencies can be discerned.  ... 
doi:10.2139/ssrn.235284 fatcat:7em5oydihzatfn4uyxo5vz5p4u
« Previous Showing results 1 — 15 out of 71 results