JournalTOCs

Networks: an International Journal
Journal Prestige (SJR): 0.94

Citation Impact (citeScore): 1
Number of Followers: 4

Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0028-3045 - ISSN (Online) 1097-0037
Published by John Wiley and Sons

[1763 journals]

Issue Information
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Abstract: Networks, Volume 79, Issue 1, Page 1-2, January 2022.
  PubDate: 2021-12-08T07:02:03-08:00
  DOI: 10.1002/net.22047
  Issue No: Vol. 79, No. 1 (2021)
Uniformly optimally reliable graphs: A survey
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Pablo Romero
  Abstract: Networks, EarlyView.
  PubDate: 2021-12-06T03:00:15-08:00
  DOI: 10.1002/net.22085
Optimizing edge sets in networks to produce ground truth communities based
on modularity
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Daniel Kosmas; John E. Mitchell, Thomas C. Sharkey, Boleslaw K. Szymanski
  Abstract: Networks, EarlyView.
  PubDate: 2021-12-01T12:00:00-08:00
  DOI: 10.1002/net.22084
An augmenting‐flow algorithm for a class of node‐capacitated
maximum flow problems
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Robert M. Curry; J. Cole Smith
  Abstract: Networks, EarlyView.
  PubDate: 2021-11-16T08:31:30-08:00
  DOI: 10.1002/net.22082
Branch‐and‐price for energy optimization in multi‐hop
wireless sensor networks
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Liding Xu; Sonia Haddad Vanier
  Abstract: Networks, EarlyView.
  PubDate: 2021-11-15T12:34:37-08:00
  DOI: 10.1002/net.22083
Minimum k‐cores and the k‐core polytope
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Derek Mikesell; Illya V. Hicks
  Abstract: Networks, EarlyView.
  PubDate: 2021-11-03T05:20:59-07:00
  DOI: 10.1002/net.22081
Simplifying obstacles for Steiner network problems in the plane
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Marcus Volz; Marcus Brazil, Charl Ras, Doreen Thomas
  Abstract: Networks, EarlyView.
  PubDate: 2021-10-16T12:00:23-07:00
  DOI: 10.1002/net.22080
The k‐path vertex cover: General bounds and chordal graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Csilla Bujtás; Marko Jakovac, Zsolt Tuza
  Abstract: Networks, EarlyView.
  PubDate: 2021-10-15T09:45:15-07:00
  DOI: 10.1002/net.22079
Autonomous traffic at intersections: An optimization‐based analysis of
possible time, energy, and CO savings
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Do Duc Le; Maximilian Merkert, Stephan Sorgatz, Mirko Hahn, Sebastian Sager
  Abstract: Networks, EarlyView.
  PubDate: 2021-10-06T03:03:23-07:00
  DOI: 10.1002/net.22078
Location of urban micro‐consolidation centers to reduce the social cost
of last‐mile deliveries of cargo: A heuristic approach
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Mario Arrieta‐Prieto; Abdelrahman Ismael, Carlos Rivera‐Gonzalez, John E. Mitchell
  Abstract: Networks, EarlyView.
  PubDate: 2021-08-09T08:37:43-07:00
  DOI: 10.1002/net.22076
Impact of knowledge on the cost of treasure hunt in trees
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Sébastien Bouchard; Arnaud Labourel, Andrzej Pelc
  Abstract: Networks, EarlyView.
  PubDate: 2021-08-07T01:37:27-07:00
  DOI: 10.1002/net.22075
Constraint programming approaches for the discretizable molecular distance
geometry problem
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Moira MacNeil; Merve Bodur
  Abstract: Networks, EarlyView.
  PubDate: 2021-07-01T02:35:21-07:00
  DOI: 10.1002/net.22068
2019–2020 Glover‐Klingman Prize Winners
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Bruce L. Golden; Douglas R. Shier
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-26T05:29:15-07:00
  DOI: 10.1002/net.22072
Novel centrality metrics for studying essentiality in protein–protein
interaction networks based on group structures
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Saeid Rasti; Chrysafis Vogiatzis
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-20T10:14:30-07:00
  DOI: 10.1002/net.22071
Affine routing for robust network design
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yacine Al‐Najjar; Walid Ben‐Ameur, Jérémie Leguay, Jocelyne Elias
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-20T10:08:56-07:00
  DOI: 10.1002/net.22070
New valid inequalities for the symmetric vehicle routing problem with
simultaneous pickup and deliveries
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yogesh Kumar Agarwal; Prahalad Venkateshan
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-17T05:34:34-07:00
  DOI: 10.1002/net.22069
The time‐consistent dial‐a‐ride problem
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Oscar Tellez; Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-11T10:29:38-07:00
  DOI: 10.1002/net.22063
Agile optimization for a real‐time facility location problem in
Internet of Vehicles networks
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Leandro do C. Martins; Daniele Tarchi, Angel A. Juan, Alessandro Fusco
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-11T06:10:17-07:00
  DOI: 10.1002/net.22067
Optimal retrieval in puzzle‐based storage with heuristic search and
tabulation
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Ariel Rosenfeld
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-11T06:03:07-07:00
  DOI: 10.1002/net.22066
Fast reliability ranking of matchstick minimal networks
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Vlad‐Florin Drǎgoi; Valeriu Beiu
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-10T02:44:15-07:00
  DOI: 10.1002/net.22064
The multifacility center problems with random demand weights
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Oded Berman; Jiamin Wang
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-06T01:57:53-07:00
  DOI: 10.1002/net.22059
Effectiveness of demand and fulfillment control in dynamic fleet
management of ride‐sharing systems
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Jarmo Haferkamp; Jan Fabian Ehmke
  Abstract: Networks, EarlyView.
  PubDate: 2021-06-04T05:50:41-07:00
  DOI: 10.1002/net.22062
Finding minimum label spanning trees using cross‐entropy method
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Radislav Vaisman
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-26T11:29:16-07:00
  DOI: 10.1002/net.22057
Optimal hierarchical clustering on a graph
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Gökçe Kahvecioğlu; David P. Morton
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-25T12:00:00-07:00
  DOI: 10.1002/net.22043
On the Complexity of Computing Maximum and Minimum
Min‐Cost‐Flows
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Kai Hoppmann‐Baum
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-25T12:00:00-07:00
  DOI: 10.1002/net.22060
New computational approaches for the power dominating set problem: Set
covering and the neighborhoods of zero forcing forts
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Logan A. Smith; Illya V. Hicks
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-25T04:11:34-07:00
  DOI: 10.1002/net.22056
Crowdsourced logistics: The pickup and delivery problem with
transshipments and occasional drivers
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Stefan Voigt; Heinrich Kuhn
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-25T03:54:17-07:00
  DOI: 10.1002/net.22045
The node cop‐win reliability of unicyclic and bicyclic graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Maimoonah Ahmed; Ben Cameron
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-24T04:22:18-07:00
  DOI: 10.1002/net.22055
Approximation algorithms for Steiner forest: An experimental study
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Laleh Ghalami; Daniel Grosu
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-13T05:37:21-07:00
  DOI: 10.1002/net.22046
A multi‐vehicle covering tour problem with speed optimization
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Joshua T. Margolis; Yongjia Song, Scott J. Mason
  Abstract: Networks, EarlyView.
  PubDate: 2021-05-10T12:26:28-07:00
  DOI: 10.1002/net.22041
Combinatorial acyclicity models for potential‐based flows
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Oliver Habeck; Marc E. Pfetsch
  Abstract: Networks, EarlyView.
  PubDate: 2021-04-09T10:11:47-07:00
  DOI: 10.1002/net.22038
Min‐sum controllable risk problems with concave risk functions of
the same value range
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Evgeny Gurevsky; Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov
  Abstract: Networks, EarlyView.
  PubDate: 2021-04-06T03:45:00-07:00
  DOI: 10.1002/net.22040
The family traveling salesman problem with incompatibility constraints
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Raquel Bernardino; Ana Paias
  Abstract: Networks, EarlyView.
  PubDate: 2021-03-26T09:25:48-07:00
  DOI: 10.1002/net.22036
The b‐bibranching problem: TDI system, packing, and discrete
convexity
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Kenjiro Takazawa
  Abstract: Networks, EarlyView.
  PubDate: 2021-03-23T03:11:26-07:00
  DOI: 10.1002/net.22035
An edge scanning method for the continuous deviation‐flow refueling
station location problem on a general network
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Omar Abbaas; Jose A. Ventura
  Abstract: Networks, EarlyView.
  PubDate: 2021-03-23T03:07:01-07:00
  DOI: 10.1002/net.22032
On matchings, T‐joins, and arc routing in road networks
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Burak Boyacı; Thu Huong Dang, Adam N. Letchford
  Abstract: Networks, EarlyView.
  PubDate: 2021-03-05T03:01:10-08:00
  DOI: 10.1002/net.22033
Cost‐optimal truck‐and‐robot routing for last‐mile
delivery
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Manuel Ostermeier; Andreas Heimfarth, Alexander Hübner
  Abstract: Networks, EarlyView.
  PubDate: 2021-03-05T02:51:33-08:00
  DOI: 10.1002/net.22030
An integer program and new lower bounds for computing the strong rainbow
connection numbers of graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Logan A. Smith; David Mildebrath, Illya V. Hicks
  Abstract: Networks, EarlyView.
  PubDate: 2021-02-28T11:49:44-08:00
  DOI: 10.1002/net.22031