Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

IEICE Transactions on Information and Systems - Japan
doi 10.1587/transinf.2017fcl0003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)