- 2024
- Victor Amelkin, Rakesh Vohra:
Yield uncertainty and strategic formation of supply chain networks. Networks 83(1): 131-152 (2024) - Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía:
On the complexity of the upgrading version of the maximal covering location problem. Networks 83(4): 627-641 (2024) - Lorenzo Balzotti, Paolo Giulio Franciosa:
How vulnerable is an undirected planar graph with respect to max flow. Networks 83(3): 570-586 (2024) - Hanane Biallach, Mustapha Bouhtou, Kristina Kumbria, Dritan Nace, Artur Tomaszewski:
Virtual network function reconfiguration in 5G networks: An optimization perspective. Networks 83(4): 673-691 (2024) - Marco Antonio Boschetti, Stefano Novellani:
Last-mile delivery with drone and lockers. Networks 83(2): 213-235 (2024) - Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust transshipment problem under consistent flow constraints. Networks 83(1): 53-82 (2024) - Rossana Cavagnini, Michael Schneider, Alina Theiß:
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group. Networks 83(1): 3-29 (2024) - Rossana Cavagnini, Michael Schneider, Alina Theiß:
A tabu search with geometry-based sparsification methods for angular traveling salesman problems. Networks 83(1): 30-52 (2024) - Victor Hugo Vidigal Corrêa, Hang Dong, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi:
An iterated local search for a multi-period orienteering problem arising in a car patrolling application. Networks 83(1): 153-168 (2024) - Guillaume Ducoffe:
Balancing graph Voronoi diagrams with one more vertex. Networks 83(2): 368-389 (2024) - Edoardo Fadda, Evelina Di Corso, Davide Brusco, Vlad Stefan Aelenei, Alexandru Balan Rares:
Math-based reinforcement learning for the adaptive budgeted influence maximization problem. Networks 83(3): 547-569 (2024) - Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski:
Min-max optimization of node-targeted attacks in service networks. Networks 83(2): 256-288 (2024) - Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen:
The complexity of the timetable-based railway network design problem. Networks 83(2): 289-299 (2024) - Georg E. A. Froehlich, Margaretha Gansterer, Karl F. Doerner:
A rolling horizon framework for the time-dependent multi-visit dynamic safe street snow plowing problem. Networks 83(2): 236-255 (2024) - Mette Gamst, David Pisinger:
Decision support for the technician routing and scheduling problem. Networks 83(1): 169-196 (2024) - Ankur Garg, Yogesh Agarwal, Rajiv Kumar Srivastava, Suresh Kumar Jakhar:
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines. Networks 83(4): 653-672 (2024) - Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and complexity for the almost equal maximum flow problem. Networks 83(4): 642-652 (2024) - Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton:
A continuous-time service network design and vehicle routing problem. Networks 83(2): 300-323 (2024) - Pengfei He, Jin-Kao Hao, Qinghua Wu:
A hybrid genetic algorithm for the Hamiltonian p-median problem. Networks 83(2): 348-367 (2024) - Julien Khamphousone, Fabián Castaño, André Rossi, Sonia Toubaline:
A survivable variant of the ring star problem. Networks 83(2): 324-347 (2024) - Eugene Lykhovyd, Sergiy Butenko, Pavlo A. Krokhmal:
Asymptotic bounds for clustering problems in random graphs. Networks 83(3): 485-502 (2024) - Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton dos Santos Souza:
An improved hybrid genetic search with data mining for the CVRP. Networks 83(4): 692-711 (2024) - Corinna Mathwieser, Eranda Çela:
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. Networks 83(3): 587-604 (2024) - Bryan David Galarza Montenegro, Kenneth Sörensen, Pieter Vansteenwegen:
A demand-responsive feeder service with a maximum headway at mandatory stops. Networks 83(1): 100-130 (2024) - Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Learning to repeatedly solve routing problems. Networks 83(3): 503-526 (2024) - Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Generalized nash fairness solutions for bi-objective minimization problems. Networks 83(1): 83-99 (2024) - Konstantin Pavlikov, Niels Christian Petersen, Jon Lilholt Sørensen:
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem. Networks 83(1): 197-209 (2024) - Michal Pióro, Mariusz Mycek, Artur Tomaszewski, Amaro de Sousa:
Maximizing SDN resilience to node-targeted attacks through joint optimization of the primary and backup controllers placements. Networks 83(2): 428-467 (2024) - David Pisinger, Siv Sørensen:
Topology reconstruction using time series data in telecommunication networks. Networks 83(2): 408-427 (2024) - She'ifa Z. Punla-Green, John E. Mitchell, Jared L. Gearhart, William E. Hart, Cynthia A. Phillips:
Shortest path network interdiction with asymmetric uncertainty. Networks 83(3): 605-623 (2024)