Research Repository

Enhanced Branch-and-Bound Framework for a Class of Sequencing Problems

Zhang, Zizhen, Teng, Luyao, Zhou, Mengchu, Wang, Jiahai and Wang, Hua ORCID: 0000-0002-8465-0996 (2019) Enhanced Branch-and-Bound Framework for a Class of Sequencing Problems. IEEE Transactions on Systems, Man, and Cybernetics: Systems. ISSN 2168-2216

08726096.pdf - Accepted Version

Download (1MB) | Preview
Item Type: Article
Additional Information:

“© © 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works"--from
To post accepted articles, this copyright notice must be displayed on the initial screen displaying IEEE copyrighted material

Uncontrolled Keywords: branch-and-bound framework; sequencing problems; dynamic programming; depth-first search; dominance rules; algorithms; quadratic traveling salesman problem; traveling repairman problem
Subjects: Current > FOR Classification > 0801 Artificial Intelligence and Image Processing
Current > FOR Classification > 0802 Computation Theory and Mathematics
Current > Division/Research > Institute for Sustainable Industries and Liveable Cities
Depositing User: VUIR
Date Deposited: 05 Feb 2020 22:29
Last Modified: 26 Feb 2020 01:53
ePrint Statistics: View download statistics for this item

Repository staff only

View Item View Item

Search Google Scholar