The July 2020 issue of Networks addresses both theoretical and algorithmic advances for a variety of network optimization problems. The specific contributions detailed in this issue are
• algorithms for time-dependent vehicle routing problems with time windows
• analysis and algorithms for routing and scheduling data flows with deadlines and capacity constraints
• algorithms for the least cost influence problem in social networks
• a policy graph approach for multistage stochastic programming problems
• an analysis of rational roots of the all-terminal reliability polynomial
• an empirical analysis of the all-pairs minimum cut problem in directed graphs
We trust that the readership of INFORMS will find these contributions to be of some interest.
------------------------------
Doug Shier and Bruce Golden
Editors-in-Chief, Networks
------------------------------