


default search action
Networks, Volume 87
Volume 87, Number 1, 2026
- Issue Information. 1-2

- Yogesh Kumar Agarwal, Prahalad Venkateshan

:
Vehicle Routing Problem With Time Windows - New Valid Inequalities From Polar Duality. 3-22 - 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. 23-38 - Dario Ostuni

, Giovanni Righini
:
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem. 39-46 - Jarmo Haferkamp

, Marlin W. Ulmer:
A Cost Function Approximation Based Large Neighborhood Search for Dynamic Medical Courier Services. 47-61 - Christof Brandstetter

, Markus Sinnl
:
Mixed-Integer Linear Programming Approaches for Nested p$$ p $$-Center Problems With Absolute and Relative Regret Objectives. 62-82 - Sarah Powell

, Ann Melissa Campbell
, Mojtaba Hosseini:
Underground Freight Transportation for Package Delivery in Urban Environments. 83-105
Volume 87, Number 2, 2026
- Issue Information. 109-110

- Stefan Faldum, Timo Gschwind

, Stefan Irnich
:
Subset-Row Inequalities and Unreachability in Path-Based Formulations for Vehicle Routing and Scheduling Problems. 111-130 - Biljana Roljic

, Yuan Chen
:
A Heavy-Duty Vehicle Routing Problem With Temperature Constraints. 131-150 - Ignacio Castañeda-Rodríguez

, Adriana Simona Mihaita
, Brunelle Marche
, Mauricio Camargo:
Exploring Roadside Management Optimisation Opportunities: A Systematic Review on Arc Routing Problems Applications and Modelling. 151-174 - Christina Büsing, Corinna Mathwieser

:
Perfect Matching Under Precedence Constraints. 175-190 - Jean Jodeau

, Nabil Absi, Rémy Chevrier, Dominique Feillet
:
The Dynamic Rail-Road Dial-A-Ride Problem. 191-209 - Niklas Tuma

, Manuel Ostermeier
, Alexander H. Hübner
:
Capacitated Vehicle Routing Problem with a Zone Tariff. 210-227 - Masoud Eshghali, Pavlo A. Krokhmal

:
Finding the Maximum Subgraph of Prescribed Strength. 228-241
Volume 87, Number 3, 2026
- Pablo Romero

:
Infinitely Many Counterexamples to Conjectures by Boesch and Ath-Sobel. 247-256 - Bruno Burin, Hamidreza Validi, Bochuan Lyu, Illya V. Hicks

:
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem. 257-265 - Lin Zhu

, Yossiri Adulyasak
, Louis-Martin Rousseau
:
Partial-Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands. 266-288 - Titi Iswari

, An Caris, Kris Braekers:
Extending the Inventory Routing Problem to Support Integrated Decision-Making in an Urban Distribution Network. 289-311 - 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. 312-321 - Guillaume Beraud-Sudreau, Lucas Létocart, Youcef Magnouche, Sébastien Martin

:
On the Multi-Commodity Flow With Convex Objective Function: Column-Generation Approaches. 322-338
Volume 87, Number 4, 2026
- Issue Information. 341-342

- Michael Palk, Stefan Voß, Raka Jovanovic:

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study. 343-371 - Esteban Leiva, Santiago Morales, Daniel Yamín, Andrés L. Medaglia:

An Exact Method for Reliable Shortest Path Problems With Correlation. 372-389 - Christian Braathen, Mario Guajardo:

Assessing the Impact of Driver Overtime in the Distribution Network of a Flower Retail Chain. 390-403 - Jannick Borowitz, Ernestine Großmann, Christian Schulz:

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs. 404-427 - Bernardetta Addis, Giuliana Carello, Gaël Reynal:

A Dynamic Capacitated Facility Location Problem With Modular Capacities and Best Service Assignment: A Comparison of Formulations. 428-442 - Anirudh Kishore Bhoopalam, Niels A. H. Agatz, Martin W. P. Savelsbergh:

Scenario-Based Platoon Lane Network Design. 443-459

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














