Solving the Time Dependent Chinese Postman Problem by Branch-and-Bound Algorithm

Release Time:2022-10-15  Hits:

Date of Publication: 2022-10-08

Journal: Information An International Interdisciplinary Journal

Institution: 电子信息与电气工程学部

Volume: 15

Issue: 12A,SI

Page Number: 5263-5270

ISSN: 1343-4500

Prev One:Schedulability Analysis for Timed Automata With Tasks

Next One:Solving the time varying postman problems with timed automata