Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs

DOI10.1016/j.ins.2016.09.043zbMath1428.90147WikidataQ62794407 ScholiaQ62794407MaRDI QIDQ2282284

Qian-Ping Gu, Lu-Ming Zhang, Xuelong Li, Yingjie Xia, Mingzhe Zhu

Publication date: 7 January 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.09.043

zbMATH Keywords

vehicle routing; intelligent transportation system; branch decomposition; sphere-cut decomposition; Steiner travelling salesman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization