Journal: Networks

Volume 75, Issue 4

337 -- 339Jacek Rak, Poul E. Heegaard, Bjarne E. Helvik. Resilience of communication networks to random failures and disasters: An optimization perspective
340 -- 355Bálazs Vass, László Németh, János Tapolcai. The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere
356 -- 373Fabio Barbosa, Amaro de Sousa, Agostinho Agra. Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes
374 -- 391Rita Girão-Silva, Boro Nedic, Matthias Gunkel, Teresa Gomes. Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort
392 -- 404Carlos Natalino, Amaro de Sousa, Lena Wosinska, Marija Furdek. Content placement in 5G-enabled edge/core data center networks resilient to link cut attacks
405 -- 419Andrés Castillo, Tetsuhei Nakashima-Paniagua, John Doucette 0001. Dual-failure restorability analysis of span-restorable meta-mesh networks
420 -- 437Ilya Kalesnikau, Michal Pióro, Michael Poss, Dritan Nace, Artur Tomaszewski. A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity
438 -- 462Tachun Lin, Zhili Zhou. Robust network function virtualization

Volume 75, Issue 3

235 -- 258Steffen Rebennack, Oleg A. Prokopyev, Bismark Singh. Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms
259 -- 277Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter
278 -- 290Nicolas Fröhlich, Andrea Maier, Horst W. Hamacher. Covering edges in networks
291 -- 309Ilyas Himmich, Issmail El Hallaoui, François Soumis. Primal column generation framework for vehicle and crew scheduling problems
310 -- 320Charl J. Ras. Fixed parameter tractability of a biconnected bottleneck Steiner network problem
321 -- 333Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal. Minimum shared-power edge cut

Volume 75, Issue 2

113 -- 123Annelieke C. Baller, Martijn van Ee, Maaike Hoogeboom, Leen Stougie. Complexity of inventory routing problems when routing is easy
124 -- 136Matías Siebert, Shabbir Ahmed 0001, George L. Nemhauser. A linear programming based approach to the Steiner tree problem with a fixed number of terminals
137 -- 157Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane. A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems
158 -- 182Bernardetta Addis, Giuliana Carello, Meihui Gao. On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations
183 -- 202Sunil Chopra, Sangho Shim. A strong formulation for the graph partition problem
203 -- 231Ningji Wei, Jose L. Walteros, Rajan Batta. On the distance between random events on a network

Volume 75, Issue 1

3 -- 17Bartosz Filipecki, Mathieu Van Vyve. Stronger path-based extended formulation for the Steiner tree problem
18 -- 33Naoyuki Kamiyama. Lexicographically optimal earliest arrival flows
34 -- 63René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko. Parameterized algorithms and data reduction for the short secluded s-t-path problem
64 -- 85Briseida Sarasola, Karl F. Doerner. Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
86 -- 94Sven de Vries, Ulf Friedrich, Bernd Perscheid. An extended formulation for the 1-wheel inequalities of the stable set polytope
95 -- 110Samin Aref, Andrew J. Mason, Mark C. Wilson. A modeling and computational study of the frustration index in signed networks