SIGN IN
SIGN UP
Exact solution of large-scale, asymmetric traveling salesman problems
Full Text:
PDF
Buy this Article
Authors:
G. Carpaneto
Univ. di Modena, Modena, Italy
M. Dell'Amico
Politecnico di Milano, Milan, Italy
P. Toth
Univ. di Bologna, Bologna, Italy
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 21 Issue 4, Dec. 1995
Pages 394-409
ACM
New York, NY
, USA
table of contents
doi>
10.1145/212066.212081
1995 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 95
· Downloads (cumulative): 1,339
· Citation Count: 27
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
assignment problem
asymmetric traveling salesman problem
branch and bound
combinatorial algorithms
experimentation
graph algorithms
path and circuit problems
performance
reduction procedure
subtour elimination
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder