The August 2021 issue of Networks addresses both theoretical and algorithmic advances for a variety of deterministic and stochastic network optimization problems. The specific contributions detailed in this issue are
• novel shortest path algorithm for networks with nonnegative weights, with pseudo-polynomial running time,
• theoretical analysis for deciding in polynomial time the feasibility of bookings in the European gas market for single-cycle networks,
• nature and roots of two-terminal reliability polynomials,
• proof of the Gross-Saccoman conjecture regarding uniformly optimal graphs in the case of failure-prone edges,
• generation of Chung-Lu random graphs with specified desirable properties,
• study of unimodal eccentricity in trees,
• survey of placement of controllers in software-defined networking
We trust that the readership of INFORMS will find these articles to be of interest.
------------------------------
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------