Search and delivery man problems : when are depth-first paths optimal?
Year of publication: |
2020
|
---|---|
Authors: | Alpern, Steve ; Lidbetter, Thomas |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 285.2020, 3 (16.9.), p. 965-976
|
Subject: | Networks | Depth-first search | Delivery Man Problem | Trees | Suchtheorie | Search theory | Mathematische Optimierung | Mathematical programming |
-
A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem
Melchiori, Anna, (2020)
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain, (2015)
-
An efficient hybrid search algorithm for job shop scheduling with operators
MencĂa, Carlos, (2013)
- More ...
-
Optimizing periodic patrols against short attacks on the line and other networks
Alpern, Steve, (2019)
-
Papadaki, Katerina, (2016)
-
Optimal trade-off between speed and acuity when searching for a small object
Alpern, Steve, (2015)
- More ...