Algorithms based on branch and bound for the flying sidekick traveling salesman problem

Autor:	Dell’Amico, Mauro, Montemanni, Roberto, Novellani, Stefano
Zdroj:	In Omega October 2021 104
Databáze:	ScienceDirect
Externí odkaz:	Zobrazit plný text záznamu Full Text from ScienceDirect