The July 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
• complexity and computational approaches to centrality measures for protein-protein interaction networks,
• study of effects of initial knowledge on treasure hunts conducted on trees,
• bounds on the minimum cardinality k-path vertex cover in a graph,
• methods for simplifying the geometry of obstacles in planar Steiner network problems,
• new and improved inequalities for a polyhedral approach to the minimum k-core problem in a graph,
• augmenting flow approach to node-capacitated maximum flow problems,
• mixed-integer programming approach for energy optimization in wireless sensor networks.
We trust that the readership of INFORMS will find these articles to be of interest.
------------------------------
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------