Novel Trends in the Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP...

Deskribapen osoa

Xehetasun bibliografikoak

Formatua:	Online
Hizkuntza:	ingelesa
Argitaratua:	IntechOpen 2021
Gaiak:	Discrete mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics
Sarrera elektronikoa:	ONIX_20210420_9781839624544_3141
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!