The January 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
• integer programming approaches to the strong rainbow connection number of graphs,
• application of matchings and T-joins to arc routing problems,
• investigation of a generalization of bibranchings and b-branching problems,
• Exact and heuristic approaches for a generalization of the family traveling salesman problem that incorporates incompatibilities,
• Combinatorial models for potential-based flows in networks,
• Investigation of min-sum controllable risk problems defined on combinatorial structures.
We trust that the readership of INFORMS will find these articles to be of interest. Two of these are available via Open Access.
------------------------------
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------