The March 2020 issue of Networks addresses both theoretical and algorithmic advances for several network optimization problems. The specific contributions detailed in this issue are
• an LP relaxation approach for the Steiner tree problem
• a strong formulation for the graph partition problem
• a complexity study of a combined inventory and routing problem
• a branch-and-cut algorithm for constructing bipartite graphs arising in digital communications
• an analysis of placement and routing problems arising in virtual network mapping
• a statistical study of distance between random events occurring on a network
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
------------------------------