Old Web
English
Sign In
Acemap
>
Paper
>
Solving the clustered traveling salesman problem with d-relaxed priority rule
Solving the clustered traveling salesman problem with d-relaxed priority rule
2020
Minh Hoàng Hà
Hoa Nguyen Phuong
Huyen Tran Ngoc Nhat
André Langevin
Martin Trépanier
Keywords:
Integer programming
Mathematics
Travelling salesman problem
Mathematical optimization
Iterated local search
Correction
Source
Cite
Save
Machine Reading By IdeaReader
18
References
1
Citations
NaN
KQI
[]