Browsing Computer Science and Automation (CSA) by Subject "Traveling Salesman Problem"
Now showing items 1-1 of 1
-
Some studies in location and scheduling problems
The location and scheduling problems considered in this study are special cases of what are called combinatorial models. A combinatorial optimization problem consists of finding, from among a finite set of alternatives, ...

