Paper Review Records
All Paper Review Records
21 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
287
days
The Two‐Echelon Multicommodity Location‐Routing Problem With Stochastic and Correlated Demands
Authors
David Escobar‐Vargas; Teodor Gabriel Crainic; Walter Rei; Stein W. WallaceShow moreShow less
Affiliations
1. Département d'informatique et de recherche opérationnelle Université de Montréal Montréal Canada; 2. Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT) Montréal Canada; 3. Département d'analytique, opérations et technologies de l'information École des sciences de la gestion, UQAM Montréal Canada; 4. Centre for Shipping and Logistics Norwegian School of Economics (NHH) Bergen NorwayShow moreShow less
803
days
On Variants of the Group Steiner Tree Problem: Considering Connected Groups of Vertices or Edges
Authors
Christoph Geis; Sven O. KrumkeShow moreShow less
Affiliations
1. Department of Mathematics RPTU Kaiserslautern‐Landau Kaiserslautern Rhineland‐Palatinate GermanyShow moreShow less
232
days
Novel Modeling Approach for Arc Routing Problems
Authors
Shuheng Wang; Christos T. MaraveliasShow moreShow less
Affiliations
1. Department of Chemical and Biological Engineering Princeton University Princeton New Jersey USA; 2. Andlinger Center for Energy and Environment Princeton University Princeton New Jersey USAShow moreShow less
212
days
Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph
Authors
Marek Kubale; Bartosz KamedulskiShow moreShow less
Affiliations
1. Faculty of Computer Science Gdynia Maritime University Gdynia PolandShow moreShow less
39
days
An Exact Algorithm for the Traveling Salesman Problem With Pickup and Delivery Under Time Windows and Ride‐Time Constraints
Authors
Xinbo Zhang; Roberto BaldacciShow moreShow less
Affiliations
1. Department of Decision Analytics and Operations City University of Hong Kong Hong Kong Hong Kong; 2. College of Science and Engineering Hamad Bin Khalifa University, Qatar Foundation Doha QatarShow moreShow less
36
days
Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows
Authors
Lelisa Kebena Bijiga; John Alasdair Warwicker; Steffen RebennackShow moreShow less
Affiliations
1. Institute for Operations Research, Stochastic Optimization Karlsruhe Institute of Technology Karlsruhe Baden Württemberg Germany; 2. School of Computing and Communications Lancaster University Leipzig Leipzig Saxony GermanyShow moreShow less
FAQ
How long does NETWORKS take to review a manuscript?
As of 2026-11-16, CrushSCI has 21 complete review records for NETWORKS. The fastest paper went from submission to acceptance in 36 days (Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows, received 2026-07-20, accepted 2026-08-25); the slowest took 803 days. The average is 368.1 days and the median is 292 days.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
