Sign in
Networks
1971
1989
2006
2024
1971
2024
Keyphrases
Publications
volume 83, number 1, 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) (2024)
Rossana Cavagnini
,
Michael Schneider
,
Alina Theiß
A tabu search with geometry-based sparsification methods for angular traveling salesman problems.
Networks
83 (1) (2024)
Christina Büsing
,
Arie M. C. A. Koster
,
Sabrina Schmitz
Robust transshipment problem under consistent flow constraints.
Networks
83 (1) (2024)
Victor Amelkin
,
Rakesh Vohra
Yield uncertainty and strategic formation of supply chain networks.
Networks
83 (1) (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) (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) (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) (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) (2024)
Mette Gamst
,
David Pisinger
Decision support for the technician routing and scheduling problem.
Networks
83 (1) (2024)
volume 83, number 2, 2024
Guillaume Ducoffe
Balancing graph Voronoi diagrams with one more vertex.
Networks
83 (2) (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) (2024)
David Pisinger
,
Siv Sørensen
Topology reconstruction using time series data in telecommunication networks.
Networks
83 (2) (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) (2024)
Pengfei He
,
Jin-Kao Hao
,
Qinghua Wu
-median problem.
Networks
83 (2) (2024)
Julien Khamphousone
,
Fabián Castaño
,
André Rossi
,
Sonia Toubaline
A survivable variant of the ring star problem.
Networks
83 (2) (2024)
Bernard Fortz
,
Mariusz Mycek
,
Michal Pióro
,
Artur Tomaszewski
Min-max optimization of node-targeted attacks in service networks.
Networks
83 (2) (2024)
Pedro H. Fernandes da Silva
,
Hervé Kerivin
,
Juan Pablo Nant
,
Annegret Katrin Wagler
Solving the routing and spectrum assignment problem, driven by combinatorial properties.
Networks
83 (2) (2024)
Marco Antonio Boschetti
,
Stefano Novellani
Last-mile delivery with drone and lockers.
Networks
83 (2) (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) (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) (2024)
volume 81, number 1, 2023
Zacharie Alès
,
Sourour Elloumi
Minimizing recovery cost of network optimization problems.
Networks
81 (1) (2023)
Burak Boyaci
,
Thu Huong Dang
,
Adam N. Letchford
Fast upper and lower bounds for a large-scale real-world arc routing problem.
Networks
81 (1) (2023)
Antoine Oustry
,
Marion Le Tilly
,
Thomas Heide Clausen
,
Claudia D'Ambrosio
,
Leo Liberti
Optimal deployment of indoor wireless local area networks.
Networks
81 (1) (2023)
Sumin Kang
,
Manish Bansal
Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set.
Networks
81 (1) (2023)
Burak Boyaci
,
Thu Huong Dang
,
Adam N. Letchford
Improving a constructive heuristic for the general routing problem.
Networks
81 (1) (2023)
Robert Benkoczi
,
Oluwaseun F. Lijoka
Capacity provisioning for evacuation on path networks.
Networks
81 (1) (2023)
Andreas Bärmann
,
Patrick Gemander
,
Lukas Hager
,
Frederik Nöth
,
Oskar Schneider
EETTlib - Energy-efficient train timetabling library.
Networks
81 (1) (2023)
volume 81, number 2, 2023
Mercedes Landete
,
Juanjo Peiró
,
Hande Yaman
Formulations and valid inequalities for the capacitated dispersion problem.
Networks
81 (2) (2023)
Haochen Luo
,
Kiavash Kianfar
Valid inequalities and facets for multi-module survivable network design problem.
Networks
81 (2) (2023)
Filippo Brunelli
,
Pierluigi Crescenzi
,
Laurent Viennot
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks
81 (2) (2023)
Alberto Santini
,
Claudia Archetti
The hazardous orienteering problem.
Networks
81 (2) (2023)
Ralf Borndörfer
,
Stephan Schwartz
,
William Surau
Vertex covering with capacitated trees.
Networks
81 (2) (2023)
Hanoch Lev-Ari
,
Yariv Ephraim
,
Brian L. Mark
Traffic rate network tomography with higher-order cumulants.
Networks
81 (2) (2023)
Daniele Ferone
,
Paola Festa
,
Serena Fugaro
,
Tommaso Pastore
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm.
Networks
81 (2) (2023)
François Hamonic
,
Cécile Albert
,
Basile Couëtoux
,
Yann Vaxès
Optimizing the ecological connectivity of landscapes.
Networks
81 (2) (2023)
volume 81, number 3, 2023
Alejandra Casado
,
Nenad Mladenovic
,
Jesús Sánchez-Oro
,
Abraham Duarte
Variable neighborhood search approach with intensified shake for monitor placement.
Networks
81 (3) (2023)
Di H. Nguyen
,
Yongjia Song
,
J. Cole Smith
A two-stage network interdiction-monitoring game.
Networks
81 (3) (2023)
Can Gokalp
,
Stephen D. Boyles
,
Avinash Unnikrishnan
Mean-standard deviation model for minimum cost flow problem.
Networks
81 (3) (2023)
Pouria Arsalani
,
Mohammad Reisi-Nafchi
,
Vahid Dardashti
,
Ghasem Moslehi
Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem.
Networks
81 (3) (2023)
Marcos Costa Roboredo
,
Ruslan Sadykov
,
Eduardo Uchoa
Solving vehicle routing problems with intermediate stops using VRPSolver models.
Networks
81 (3) (2023)
volume 81, number 4, 2023
M. Hakan Akyüz
,
I. Kuban Altinel
,
Temel Öncan
Maximum weight perfect matching problem with additional disjunctive conflict constraints.
Networks
81 (4) (2023)
Christina Graves
More reliable graphs are not always stronger.
Networks
81 (4) (2023)
Nicolau Andrés-Thió
,
Marcus Brazil
,
Charl J. Ras
,
Doreen A. Thomas
Network augmentation for disaster-resilience against geographically correlated failure.
Networks
81 (4) (2023)
Nicola Bianchessi
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm.
Networks
81 (4) (2023)
Alberto Boggio Tomasaz
,
Roberto Cordone
,
Pierre Hosteins
A combinatorial branch and bound for the safe set problem.
Networks
81 (4) (2023)
volume 80, number 4, 2022
Davide Cazzaro
,
David Pisinger
Balanced cable routing for offshore wind farms with obstacles.
Networks
80 (4) (2022)
Luca Bertazzi
,
Xingyin Wang
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem.
Networks
80 (4) (2022)
Daniel Gross
,
Nathan Kahl
,
Kristi Luttrell
,
John T. Saccoman
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend.
Networks
80 (4) (2022)
John Gunnar Carlsson
,
Bo Jones
Continuous approximation formulas for location problems.
Networks
80 (4) (2022)
Pablo Romero
Uniformly optimally reliable graphs: A survey.
Networks
80 (4) (2022)