Computing compatible tours for the symmetric traveling salesman problem (2010)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s12532-010-0021-5
Publication URI: http://dx.doi.org/10.1007/s12532-010-0021-5
Type: Journal Article/Review
Parent Publication: Mathematical Programming Computation
Issue: 1