Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 75
Volume 75, Number 1, January 2020
- Bartosz Filipecki
, Mathieu Van Vyve:
Stronger path-based extended formulation for the Steiner tree problem. 3-17 - Naoyuki Kamiyama:
Lexicographically optimal earliest arrival flows. 18-33 - René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for the short secluded s-t-path problem. 34-63 - Briseida Sarasola, Karl F. Doerner:
Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location. 64-85 - Sven de Vries, Ulf Friedrich, Bernd Perscheid:
An extended formulation for the 1-wheel inequalities of the stable set polytope. 86-94 - Samin Aref, Andrew J. Mason, Mark C. Wilson:
A modeling and computational study of the frustration index in signed networks. 95-110
Volume 75, Number 2, March 2020
- Annelieke C. Baller, Martijn van Ee, Maaike Hoogeboom, Leen Stougie:
Complexity of inventory routing problems when routing is easy. 113-123 - Matías Siebert, Shabbir Ahmed, George L. Nemhauser:
A linear programming based approach to the Steiner tree problem with a fixed number of terminals. 124-136 - Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems. 137-157 - Bernardetta Addis, Giuliana Carello, Meihui Gao:
On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations. 158-182 - Sunil Chopra, Sangho Shim:
A strong formulation for the graph partition problem. 183-202 - Ningji Wei, Jose L. Walteros, Rajan Batta:
On the distance between random events on a network. 203-231
Volume 75, Number 3, April 2020
- Steffen Rebennack, Oleg A. Prokopyev, Bismark Singh:
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms. 235-258 - Julien 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. 259-277 - Nicolas Fröhlich, Andrea Maier, Horst W. Hamacher:
Covering edges in networks. 278-290 - Ilyas Himmich, Issmail El Hallaoui, François Soumis:
Primal column generation framework for vehicle and crew scheduling problems. 291-309 - Charl J. Ras:
Fixed parameter tractability of a biconnected bottleneck Steiner network problem. 310-320 - Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum shared-power edge cut. 321-333
Volume 75, Number 4, June 2020
Special Issue Articles
- Jacek Rak, Poul E. Heegaard, Bjarne E. Helvik:
Resilience of communication networks to random failures and disasters: An optimization perspective. 337-339 - Balázs 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. 340-355 - Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes. 356-373 - Rita 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. 374-391 - Carlos Natalino, Amaro de Sousa, Lena Wosinska, Marija Furdek:
Content placement in 5G-enabled edge/core data center networks resilient to link cut attacks. 392-404 - Andrés Castillo, Tetsuhei Nakashima-Paniagua, John Doucette:
Dual-failure restorability analysis of span-restorable meta-mesh networks. 405-419 - Ilya 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. 420-437 - Tachun Lin, Zhili Zhou:
Robust network function virtualization. 438-462
a service of 
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-06-10 21:31 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
