共 50 条
- [1] Algorithms based on branch and bound for the flying sidekick traveling salesman problem [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
- [3] A Branch and Bound Algorithm for the Probabilistic Traveling Salesman Problem [J]. 2015 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2015, : 697 - 702
- [5] Solving Standard Traveling Salesman Problem and Multiple Traveling Salesman Problem by Using Branch-and-Bound [J]. PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM20): RESEARCH IN MATHEMATICAL SCIENCES: A CATALYST FOR CREATIVITY AND INNOVATION, PTS A AND B, 2013, 1522 : 1406 - 1411
- [10] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm [J]. Automatic Control and Computer Sciences, 2021, 55 : 816 - 826