The traveling salesman problem is one of the most famous combinatorial optimization problems, and has been intensively studied in the last decades. Many extensions to the basic problem have been also proposed, with the aim of making the resulting mathematical models as much realistic as possible.
Heuristic algorithms for the robust traveling salesman problem with interval data / Montemanni, R; Barta, J; Mastrolilli, M; Gambardella, Lm. - (2007). (Intervento presentato al convegno Proceedings of TRISTAN VI – The 6th Triennial Symposium on Transportation Anal- ysis tenutosi a Phuket Thailand nel June 2007).
Heuristic algorithms for the robust traveling salesman problem with interval data
Montemanni R;
2007
Abstract
The traveling salesman problem is one of the most famous combinatorial optimization problems, and has been intensively studied in the last decades. Many extensions to the basic problem have been also proposed, with the aim of making the resulting mathematical models as much realistic as possible.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
