Výsledky vyhľadávania - LIFO implicit enumeration algorithm
-
1
A branch-and-bound algorithm for the double travelling salesman problem with two stacks
ISSN: 0028-3045, 1097-0037Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2013Vydané v Networks (01.01.2013)“…This article studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup…”
Získať plný text
Journal Article