The March 2022 issue of Networks addresses both theoretical and algorithmic advances for a variety of network optimization problems. The specific contributions detailed in this issue include
• heuristic approaches to vehicle routing for target surveillance,
• efficient approaches to a parametric biobjective graph clustering problem,
• an extensive computational study of approximation algorithms for the Steiner forest problem,
• investigation of node cop-win reliability and construction of graphs that are uniformly most reliable in this respect,
• new modeling and computational approaches for the power dominating set problem,
• a cross-entropy approach to finding minimum label spanning trees,
• complexity analysis of the maximum (and the minimum) min cost flow problems.
We trust that the readership of INFORMS will find these articles to be of interest. One article is available via Open Access and the rest are Free to Read.
------------------------------
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------