- Christina Büsing, Corinna Mathwieser. Perfect Matching Under Precedence Constraints. Networks, 87(2):175-190, 2026.
- Christof Brandstetter, Markus Sinnl. Mixed-Integer Linear Programming Approaches for Nested p$$ p $$-Center Problems With Absolute and Relative Regret Objectives. Networks, 87(1):62-82, 2026.
- Issue Information. Networks, 87(1):1-2, 2026.
- Dario Ostuni, Giovanni Righini. A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem. Networks, 87(1):39-46, 2026.
- Pablo Romero 0001. Infinitely Many Counterexamples to Conjectures by Boesch and Ath-Sobel. Networks, 87(3):247-256, 2026.
- Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen. Tractable but Hard to Approximate: The Bi-Objective Minimum s-t-Cut Problem With Binary Capacities. Networks, 87(3):312-321, 2026.
- Biljana Roljic, Yuan Chen. A Heavy-Duty Vehicle Routing Problem With Temperature Constraints. Networks, 87(2):131-150, 2026.
- Dilson Lucas Pereira, Alexandre Salles da Cunha. Branch-and-Bound Algorithms for the K$$ K $$-Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation. Networks, 87(1):23-38, 2026.
- Sarah Powell, Ann Melissa Campbell, Mojtaba Hosseini. Underground Freight Transportation for Package Delivery in Urban Environments. Networks, 87(1):83-105, 2026.
- Masoud Eshghali, Pavlo A. Krokhmal. Finding the Maximum Subgraph of Prescribed Strength. Networks, 87(2):228-241, 2026.