- Information in the Traveling Salesman ProblemGilad Barach; Hugo Fort; Yoni Mehlman; Fredy ZypmanApplied Mathematics, 2012, 03(08): 926-930.
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruningDavid R., Morrison; Sheldon H., Jacobson; Jason J., Sauppe; Edward C., SewellDiscrete Optimization, 2016, 19: 79-102.被引 88
- Polynomial formulation and heuristic based approach for the k-travelling repairman problemImen Ome, Ezzine; Sonda, ElloumiInternational Journal of Mathematics in Operational Research, 2012, 4(5): 503.被引 5
书籍章节
A Constraint Programming Approach for the Traveling Purchaser Problem
2被引5阅读
