Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/networks/networks70.bht:"
@article{DBLP:journals/networks/Averbakh17, author = {Igor Averbakh}, title = {Minimizing the makespan in multiserver network restoration problems}, journal = {Networks}, volume = {70}, number = {1}, pages = {60--68}, year = {2017}, url = {https://doi.org/10.1002/net.21750}, doi = {10.1002/NET.21750}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Averbakh17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/AverbuchPR17, author = {Amir Averbuch and Irete Peeri and Yehuda Roditty}, title = {New upper bound on \emph{m}-time-relaxed \emph{k}-broadcast graphs}, journal = {Networks}, volume = {70}, number = {2}, pages = {72--78}, year = {2017}, url = {https://doi.org/10.1002/net.21749}, doi = {10.1002/NET.21749}, timestamp = {Fri, 25 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AverbuchPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BardossyR17, author = {M. Gisela Bardossy and S. Raghavan}, title = {An inexact sample average approximation approach for the stochastic connected facility location problem}, journal = {Networks}, volume = {70}, number = {1}, pages = {19--33}, year = {2017}, url = {https://doi.org/10.1002/net.21743}, doi = {10.1002/NET.21743}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BardossyR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BektasGS17, author = {Tolga Bektas and Luis Eduardo Neves Gouveia and Daniel Santos}, title = {New path elimination constraints for multi-depot routing problems}, journal = {Networks}, volume = {70}, number = {3}, pages = {246--261}, year = {2017}, url = {https://doi.org/10.1002/net.21760}, doi = {10.1002/NET.21760}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BektasGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BergerGV17, author = {Franziska Berger and Peter Gritzmann and Sven de Vries}, title = {Computing cyclic invariants for molecular graphs}, journal = {Networks}, volume = {70}, number = {2}, pages = {116--131}, year = {2017}, url = {https://doi.org/10.1002/net.21757}, doi = {10.1002/NET.21757}, timestamp = {Fri, 25 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BergerGV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BevernKS17, author = {Ren{\'{e}} van Bevern and Christian Komusiewicz and Manuel Sorge}, title = {A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments}, journal = {Networks}, volume = {70}, number = {3}, pages = {262--278}, year = {2017}, url = {https://doi.org/10.1002/net.21742}, doi = {10.1002/NET.21742}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BevernKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BusingGKLT17, author = {Christina B{\"{u}}sing and Alexandra Grub and Arie M. C. A. Koster and Waldemar Laube and Martin Tieves}, title = {Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations}, journal = {Networks}, volume = {70}, number = {4}, pages = {342--359}, year = {2017}, url = {https://doi.org/10.1002/net.21785}, doi = {10.1002/NET.21785}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BusingGKLT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CanaleRR17, author = {Eduardo Alberto Canale and Pablo Romero and Gerardo Rubino}, title = {Factorization and exact evaluation of the source-terminal diameter-constrained reliability}, journal = {Networks}, volume = {70}, number = {4}, pages = {283--291}, year = {2017}, url = {https://doi.org/10.1002/net.21780}, doi = {10.1002/NET.21780}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/CanaleRR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ConstantinoMP17, author = {Miguel Fragoso Constantino and Maria C{\^{a}}ndida Mour{\~{a}}o and Leonor Santiago Pinto}, title = {Dissimilar arc routing problems}, journal = {Networks}, volume = {70}, number = {3}, pages = {233--245}, year = {2017}, url = {https://doi.org/10.1002/net.21763}, doi = {10.1002/NET.21763}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/ConstantinoMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CorberanGLPS17, author = {{\'{A}}ngel Corber{\'{a}}n and Bruce L. Golden and Oliver Lum and Isaac Plana and Jos{\'{e}} M. Sanchis}, title = {Aesthetic considerations for the min-max K-Windy Rural Postman Problem}, journal = {Networks}, volume = {70}, number = {3}, pages = {216--232}, year = {2017}, url = {https://doi.org/10.1002/net.21748}, doi = {10.1002/NET.21748}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/CorberanGLPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CorberanMP17, author = {{\'{A}}ngel Corber{\'{a}}n and Maria C{\^{a}}ndida Mour{\~{a}}o and Leonor Santiago Pinto}, title = {Preface: Special issue on Arc Routing Problems}, journal = {Networks}, volume = {70}, number = {3}, pages = {143}, year = {2017}, url = {https://doi.org/10.1002/net.21766}, doi = {10.1002/NET.21766}, timestamp = {Mon, 02 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/CorberanMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Dankelmann17, author = {Peter Dankelmann}, title = {Bounds on the fault-diameter of graphs}, journal = {Networks}, volume = {70}, number = {2}, pages = {132--140}, year = {2017}, url = {https://doi.org/10.1002/net.21758}, doi = {10.1002/NET.21758}, timestamp = {Fri, 25 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Dankelmann17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GhediniRS17, author = {Cinara Ghedini and Carlos H. C. Ribeiro and Lorenzo Sabattini}, title = {Toward fault-tolerant multi-robot networks}, journal = {Networks}, volume = {70}, number = {4}, pages = {388--400}, year = {2017}, url = {https://doi.org/10.1002/net.21784}, doi = {10.1002/NET.21784}, timestamp = {Fri, 04 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GhediniRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GoldenS17, author = {Bruce L. Golden and Douglas R. Shier}, title = {Editorial}, journal = {Networks}, volume = {70}, number = {1}, pages = {3}, year = {2017}, url = {https://doi.org/10.1002/net.21753}, doi = {10.1002/NET.21753}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GoldenS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GoldenS17a, author = {Bruce L. Golden and Douglas R. Shier}, title = {Editorial: 2016 Glover-Klingman Prize Winners}, journal = {Networks}, volume = {70}, number = {2}, pages = {71}, year = {2017}, url = {https://doi.org/10.1002/net.21755}, doi = {10.1002/NET.21755}, timestamp = {Fri, 25 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GoldenS17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GomesRE17, author = {Teresa Gomes and Luis Raposo and Georgios Ellinas}, title = {Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks}, journal = {Networks}, volume = {70}, number = {4}, pages = {360--372}, year = {2017}, url = {https://doi.org/10.1002/net.21781}, doi = {10.1002/NET.21781}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/GomesRE17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/HmaitySMTP17, author = {Ali Hmaity and Marco Savi and Francesco Musumeci and Massimo Tornatore and Achille Pattavina}, title = {Protection strategies for virtual network functions placement and service chains provisioning}, journal = {Networks}, volume = {70}, number = {4}, pages = {373--387}, year = {2017}, url = {https://doi.org/10.1002/net.21782}, doi = {10.1002/NET.21782}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/HmaitySMTP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/JonssonRS17, author = {Magnus Jonsson and Jacek Rak and Arun Somani}, title = {Preface: Design of Resilient Communication Networks}, journal = {Networks}, volume = {70}, number = {4}, pages = {281--282}, year = {2017}, url = {https://doi.org/10.1002/net.21790}, doi = {10.1002/NET.21790}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/JonssonRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/LewisG17, author = {Mark W. Lewis and Fred W. Glover}, title = {Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis}, journal = {Networks}, volume = {70}, number = {2}, pages = {79--97}, year = {2017}, url = {https://doi.org/10.1002/net.21751}, doi = {10.1002/NET.21751}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/LewisG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MartinsGT17, author = {L{\'{u}}cia Martins and Teresa Gomes and David Tipper}, title = {Efficient heuristics for determining node-disjoint path pairs visiting specified nodes}, journal = {Networks}, volume = {70}, number = {4}, pages = {292--307}, year = {2017}, url = {https://doi.org/10.1002/net.21778}, doi = {10.1002/NET.21778}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MartinsGT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Monroy-LichtAL17, author = {Marcela Monroy{-}Licht and Ciro{-}Alberto Amaya and Andr{\'{e}} Langevin}, title = {Adaptive large neighborhood search algorithm for the rural postman problem with time windows}, journal = {Networks}, volume = {70}, number = {1}, pages = {44--59}, year = {2017}, url = {https://doi.org/10.1002/net.21747}, doi = {10.1002/NET.21747}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Monroy-LichtAL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MouraoP17, author = {Maria C{\^{a}}ndida Mour{\~{a}}o and Leonor Santiago Pinto}, title = {An updated annotated bibliography on arc routing problems}, journal = {Networks}, volume = {70}, number = {3}, pages = {144--194}, year = {2017}, url = {https://doi.org/10.1002/net.21762}, doi = {10.1002/NET.21762}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/MouraoP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MyslitskiRK17, author = {Kanstantsin Myslitski and Jacek Rak and Lukasz Kuszner}, title = {Toward fast calculation of communication paths for resilient routing}, journal = {Networks}, volume = {70}, number = {4}, pages = {308--326}, year = {2017}, url = {https://doi.org/10.1002/net.21789}, doi = {10.1002/NET.21789}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MyslitskiRK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/NourollahiG17, author = {Sevnaz Nourollahi and Archis Ghate}, title = {Duality in convex minimum cost flow problems on infinite networks and hypernetworks}, journal = {Networks}, volume = {70}, number = {2}, pages = {98--115}, year = {2017}, url = {https://doi.org/10.1002/net.21754}, doi = {10.1002/NET.21754}, timestamp = {Fri, 25 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/NourollahiG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/PasicBT17, author = {Alija Pasic and P{\'{e}}ter Babarczi and J{\'{a}}nos Tapolcai}, title = {Unambiguous switching link group failure localization in all-optical networks}, journal = {Networks}, volume = {70}, number = {4}, pages = {327--341}, year = {2017}, url = {https://doi.org/10.1002/net.21779}, doi = {10.1002/NET.21779}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/PasicBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/PoikonenWG17, author = {Stefan Poikonen and Xingyin Wang and Bruce L. Golden}, title = {The vehicle routing problem with drones: Extended models and connections}, journal = {Networks}, volume = {70}, number = {1}, pages = {34--43}, year = {2017}, url = {https://doi.org/10.1002/net.21746}, doi = {10.1002/NET.21746}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/PoikonenWG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Quirion-BlaisLL17, author = {Olivier Quirion{-}Blais and Andr{\'{e}} Langevin and Fabien Lehu{\'{e}}d{\'{e}} and Olivier P{\'{e}}ton and Martin Tr{\'{e}}panier}, title = {Solving the large-scale min-max K-rural postman problem for snow plowing}, journal = {Networks}, volume = {70}, number = {3}, pages = {195--215}, year = {2017}, url = {https://doi.org/10.1002/net.21759}, doi = {10.1002/NET.21759}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Quirion-BlaisLL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/TaskinS17, author = {Z. Caner Taskin and J. Cole Smith}, title = {Branch-cut-price algorithms for solving a class of search problems on general graphs}, journal = {Networks}, volume = {70}, number = {1}, pages = {4--18}, year = {2017}, url = {https://doi.org/10.1002/net.21740}, doi = {10.1002/NET.21740}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/TaskinS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.