default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 66
Volume 66, Number 1, August 2015
- Alberto Caprara:
Timetabling and assignment problems in railway planning and integer multicommodity flow. 1-10 - Faiz Hamid
, Yogesh Kumar Agarwal:
Solving the two-facility network design problem with 3-partition facets. 11-32 - Birgit Engels, Rainer Schrader:
Freight car dispatching with generalized flows. 33-39 - Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau:
A railroad maintenance problem solved with a cut and column generation matheuristic. 40-56 - Thomas L. Werth, Sabine Büttner, Sven Oliver Krumke:
Robust bottleneck routing games. 57-66 - Burak Büke, J. Cole Smith, Sadie Thomas:
On a Random Walk Survivability problem with arc failures and memory. 67-86
Volume 66, Number 2, September 2015
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2013 Glover-Klingman Prize winners. 87
- Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Stability of adversarial routing with feedback. 88-97 - Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss:
Robust constrained shortest path problems under budgeted uncertainty. 98-111 - Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero:
The time-dependent quickest path problem: Properties and bounds. 112-117 - Gábor Németh, Gábor Rétvári:
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures. 118-135 - Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel:
Selecting vertex disjoint paths in plane graphs. 136-144 - Noam Goldberg, Sven Leyffer, Ilya Safro:
Optimal response to epidemics and cyber attacks in networks. 145-158 - Sara Mattia:
The cut property under demand uncertainty. 159-168
Volume 66, Number 3, October 2015
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2014 Glover-Klingman Prize winners. 169
- Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Critical nodes for distance-based connectivity and related problems in graphs. 170-195 - Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph orientation and flows over time. 196-209 - Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. 210-213 - Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. 214-234 - Jakarin Chawachat, Jittat Fakcharoenphol:
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. 235-249
Volume 66, Number 4, December 2015
- Jacek Rak, James P. G. Sterbenz:
Preface: Optimization issues in resilient network design and modeling. 251-252 - Michal Kucharzak, Krzysztof Walkowiak, Pawel Kopec, Damian Bulira, Andrzej Kasprzak:
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks. 253-266 - Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz:
Generalized elastic flow rerouting scheme. 267-281 - Jaime Silva, Teresa Gomes, David Tipper, Lúcia Martins, Velin Kounev:
An effective algorithm for computing all-terminal reliability bounds. 282-295 - Eduardo Alberto Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior. 296-305 - Song Yang, Stojan Trajanovski, Fernando A. Kuipers:
Availability-based path selection and network vulnerability assessment. 306-319 - Rein Houthooft, Sahel Sahhaf, Wouter Tavernier, Filip De Turck, Didier Colle, Mario Pickavet:
Optimizing robustness in geometric routing via embedding redundancy and regeneration. 320-334 - Yufei Cheng, Deep Medhi, James P. G. Sterbenz:
Geodiverse routing with path delay and skew requirement under area-based challenges. 335-346 - Mohammed Liakat Ali, Pin-Han Ho, János Tapolcai:
SRLG failure localization using nested m-trails and their application to adaptive probing. 347-363 - Dimitri Papadimitriou, Bernard Fortz:
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem. 364-379 - Arunabha Sen, Anisha Mazumder, Sujogya Banerjee, Arun Das, Chenyang Zhou, Shahrzad Shirazipourazad:
Region-based fault-tolerant distributed file storage system design in networks. 380-395
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 2026-07-28 23:34 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
