The July 2019
issue of
Networks contains articles that address the solution of classical network problems as well as nonstandard optimization problems. Three of the articles develop improved algorithms for the following problems: shortest paths, maximum flow vitality (change in flow by removal of network nodes/edges), and rainbow cycle covers in a graph. Another article studies the complexity of algorithms for the spread of a virus or a fire on a network.
Two additional papers provide improved algorithmic approaches to network problems having uncertain network elements. One develops robust two-stage algorithms for gas network operations and another develops algorithms for distributionally robust problems in project networks.
We trust that the readership of INFORMS will find these contributions to be of some interest.
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------
Doug Shier and Bruce Golden
Editors-in-Chief
------------------------------