The constrained shortest path tour problem
| Year of publication: | 
                              October 2016         | 
|---|---|
| Authors: | Ferone, Daniele ; Guerriero, Francesca ; Laganè, Demetrio | 
| Published in: | 
                  	  	      	    Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 74.2016, p. 64-77      	   | 
| Subject: | Shortest path problems | Network flow problems | Combinatorial optimization | Branch & Bound | GRASP | Mathematische Optimierung | Mathematical programming | Netzplantechnik | Project network techniques | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Projektmanagement | Project management | Graphentheorie | Graph theory | 
- 
                      
          Choi, Byung-cheon, (2014) 
- 
                      A network simplex method for the budget-constrained minimum cost flow problem Holzhauser, Michael, (2017) 
- 
                      
          Neamatian Monemi, Rahimeh, (2025) 
- More ...
- 
                      The rainbow Steiner tree problem Ferone, Daniele, (2022) 
- 
                      The crowd-shipping with penalty cost function and uncertain travel times Di Puglia Pugliese, Luigi, (2023) 
- 
                      Shortest path tour problem with time windows Di Puglia Pugliese, Luigi, (2020) 
- More ...
