Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 83
Volume 83, Number 1, January 2024
SPECIAL ISSUE ARTICLES
- 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. 3-29 - Rossana Cavagnini, Michael Schneider, Alina Theiß:
A tabu search with geometry-based sparsification methods for angular traveling salesman problems. 30-52
RESEARCH ARTICLE
- Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust transshipment problem under consistent flow constraints. 53-82
SPECIAL ISSUE ARTICLE
- Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Generalized nash fairness solutions for bi-objective minimization problems. 83-99
RESEARCH ARTICLES
- Bryan David Galarza Montenegro, Kenneth Sörensen, Pieter Vansteenwegen:
A demand-responsive feeder service with a maximum headway at mandatory stops. 100-130 - Victor Amelkin, Rakesh Vohra:
Yield uncertainty and strategic formation of supply chain networks. 131-152
SPECIAL ISSUE ARTICLES
- 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. 153-168 - Mette Gamst, David Pisinger:
Decision support for the technician routing and scheduling problem. 169-196 - Konstantin Pavlikov, Niels Christian Petersen, Jon Lilholt Sørensen:
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem. 197-209
Volume 83, Number 2, March 2024
SPECIAL ISSUE ARTICLES
- Marco Antonio Boschetti, Stefano Novellani:
Last-mile delivery with drone and lockers. 213-235 - 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. 236-255 - Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski:
Min-max optimization of node-targeted attacks in service networks. 256-288 - Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen:
The complexity of the timetable-based railway network design problem. 289-299 - Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton:
A continuous-time service network design and vehicle routing problem. 300-323 - Julien Khamphousone, Fabián Castaño, André Rossi, Sonia Toubaline:
A survivable variant of the ring star problem. 324-347 - Pengfei He, Jin-Kao Hao, Qinghua Wu:
A hybrid genetic algorithm for the Hamiltonian p-median problem. 348-367
RESEARCH ARTICLE
- Guillaume Ducoffe:
Balancing graph Voronoi diagrams with one more vertex. 368-389
SPECIAL ISSUE ARTICLE
- Pedro H. Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler:
Solving the routing and spectrum assignment problem, driven by combinatorial properties. 390-407
RESEARCH ARTICLE
- David Pisinger, Siv Sørensen:
Topology reconstruction using time series data in telecommunication networks. 408-427
SPECIAL ISSUE ARTICLE
- 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. 428-467
a service of 
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.
last updated on 2024-04-26 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
