The April 2020 issue of Networks addresses both theoretical and algorithmic advances for several network optimization problems. The specific contributions detailed in this issue are
• complexity analysis and algorithms for a two-stage stochastic minimum cut problem
• complexity analysis for the minimum diameter spanning tree problem under the reload cost model
• complexity analysis and approximation algorithms for edge covering in facility location
• primal column generation for vehicle and crew scheduling problems
• complexity analysis and algorithms for the biconnected bottleneck Steiner network problem
• algorithms for the minimum shared-power edge cut problem
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
------------------------------