The October 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
• analysis of integrality in min-cost flow problems on linked duplicate graphs with equal flow constraints,
• a column generation approach for a demand-responsive feeder service with both mandatory and optional bus stops,
• a branch-and-cut algorithm for a pickup and delivery TSP with handling costs,
• integer programming formulations and relaxations for finding optimal connected subgraphs,
• a simple proof of the Gross-Saccoman conjecture for uniformly most reliable multigraphs,
• complexity results for the bilevel minimum spanning tree problem and its variants,
• formulation and solution approaches for minimum cost production-routing problems with consistency requirements.
Three of these articles are published Open Access.
We trust that the readership of INFORMS will find these articles to be of interest.
------------------------------
Douglas Shier
Bruce Golden
Editors-in-Chief, Networks
------------------------------