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

[img]
Preview
08726096.pdf - Accepted Version (1MB) | Preview

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

Dimensions Badge

Altmetric Badge

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 https://www.ieee.org/publications/rights/rights-policies.html
To post accepted articles, this copyright notice must be displayed on the initial screen displaying IEEE copyrighted material

Item type Article
URI https://vuir.vu.edu.au/id/eprint/40080
DOI https://doi.org/10.1109/TSMC.2019.2916202
Official URL https://ieeexplore.ieee.org/document/8726096
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
Keywords branch-and-bound framework; sequencing problems; dynamic programming; depth-first search; dominance rules; algorithms; quadratic traveling salesman problem; traveling repairman problem
Citations in Scopus 1 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login