default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 70
Volume 70, Number 1, August 2017
- Bruce L. Golden, Douglas R. Shier:
Editorial. 3
- Z. Caner Taskin, J. Cole Smith
:
Branch-cut-price algorithms for solving a class of search problems on general graphs. 4-18 - M. Gisela Bardossy, S. Raghavan:
An inexact sample average approximation approach for the stochastic connected facility location problem. 19-33 - Stefan Poikonen, Xingyin Wang, Bruce L. Golden:
The vehicle routing problem with drones: Extended models and connections. 34-43 - Marcela Monroy-Licht, Ciro-Alberto Amaya, André Langevin:
Adaptive large neighborhood search algorithm for the rural postman problem with time windows. 44-59 - Igor Averbakh:
Minimizing the makespan in multiserver network restoration problems. 60-68
Volume 70, Number 2, September 2017
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2016 Glover-Klingman Prize Winners. 71
- Amir Averbuch, Irete Peeri, Yehuda Roditty:
New upper bound on m-time-relaxed k-broadcast graphs. 72-78 - Mark W. Lewis, Fred W. Glover:
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. 79-97 - Sevnaz Nourollahi, Archis Ghate:
Duality in convex minimum cost flow problems on infinite networks and hypernetworks. 98-115 - Franziska Berger, Peter Gritzmann, Sven de Vries:
Computing cyclic invariants for molecular graphs. 116-131 - Peter Dankelmann:
Bounds on the fault-diameter of graphs. 132-140
Volume 70, Number 3, October 2017
Preface
- Ángel Corberán, Maria Cândida Mourão, Leonor Santiago Pinto:
Preface: Special issue on Arc Routing Problems. 143
- Maria Cândida Mourão, Leonor Santiago Pinto:
An updated annotated bibliography on arc routing problems. 144-194 - Olivier Quirion-Blais, André Langevin, Fabien Lehuédé, Olivier Péton, Martin Trépanier:
Solving the large-scale min-max K-rural postman problem for snow plowing. 195-215 - Ángel Corberán, Bruce L. Golden, Oliver Lum, Isaac Plana, José M. Sanchis:
Aesthetic considerations for the min-max K-Windy Rural Postman Problem. 216-232 - Miguel Fragoso Constantino, Maria Cândida Mourão, Leonor Santiago Pinto:
Dissimilar arc routing problems. 233-245 - Tolga Bektas, Luis Eduardo Neves Gouveia, Daniel Santos:
New path elimination constraints for multi-depot routing problems. 246-261 - René van Bevern, Christian Komusiewicz, Manuel Sorge:
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. 262-278
Volume 70, Number 4, December 2017
Preface
- Magnus Jonsson, Jacek Rak, Arun Somani:
Preface: Design of Resilient Communication Networks. 281-282
- Eduardo Alberto Canale, Pablo Romero, Gerardo Rubino:
Factorization and exact evaluation of the source-terminal diameter-constrained reliability. 283-291 - Lúcia Martins, Teresa Gomes, David Tipper:
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes. 292-307 - Kanstantsin Myslitski, Jacek Rak, Lukasz Kuszner:
Toward fast calculation of communication paths for resilient routing. 308-326 - Alija Pasic, Péter Babarczi, János Tapolcai:
Unambiguous switching link group failure localization in all-optical networks. 327-341 - Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves:
Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. 342-359 - Teresa Gomes, Luis Raposo, Georgios Ellinas:
Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks. 360-372 - Ali Hmaity, Marco Savi, Francesco Musumeci, Massimo Tornatore, Achille Pattavina:
Protection strategies for virtual network functions placement and service chains provisioning. 373-387 - Cinara Ghedini, Carlos H. C. Ribeiro, Lorenzo Sabattini:
Toward fault-tolerant multi-robot networks. 388-400
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.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
