1 resultado para Complex network. Optimal path. Optimal path cracks
em Bucknell University Digital Commons - Pensilvania - USA
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Repository Napier (1)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberdeen University (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (6)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (22)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (13)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (14)
- Boston University Digital Common (7)
- Brock University, Canada (8)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (8)
- Cambridge University Engineering Department Publications Database (6)
- CentAUR: Central Archive University of Reading - UK (31)
- Center for Jewish History Digital Collections (7)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (15)
- Cochin University of Science & Technology (CUSAT), India (2)
- Coffee Science - Universidade Federal de Lavras (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (52)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (4)
- Digital Peer Publishing (2)
- DigitalCommons@The Texas Medical Center (7)
- DigitalCommons@University of Nebraska - Lincoln (7)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (6)
- Duke University (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (11)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (143)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (9)
- Massachusetts Institute of Technology (3)
- Memoria Académica - FaHCE, UNLP - Argentina (4)
- National Center for Biotechnology Information - NCBI (8)
- Nottingham eTheses (1)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (5)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (23)
- Queensland University of Technology - ePrints Archive (266)
- Repositório Científico da Universidade de Évora - Portugal (5)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (8)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (35)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (8)
- Universidad del Rosario, Colombia (4)
- Universidad Politécnica de Madrid (24)
- Universidade Federal do Rio Grande do Norte (UFRN) (10)
- Universidade Metodista de São Paulo (3)
- Universita di Parma (1)
- Universitat de Girona, Spain (7)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal, Canada (15)
- University of Michigan (2)
- University of Queensland eSpace - Australia (10)
- University of Washington (4)
- WestminsterResearch - UK (4)
Resumo:
A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.