|
|||||
|
|
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks |
|
| Institution: | Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS (UMR 7030), F-93430, Villetaneuse, France |
| Abstract: | |
| Keywords: | Traveling Salesman problem Multiple stacks Polyhedral study Branch-and-cut |
| 本文献已被 ScienceDirect 等数据库收录！ | |