Limited access: U-M users only
Access by request
Access via HathiTrust
Access via FulcrumAn efficient transformation of the generalized traveling salesman problem
| dc.contributor.author | Noon, Charles Edward | en_US |
| dc.contributor.author | Bean, James C. | en_US |
| dc.date.accessioned | 2006-02-03T18:01:44Z | |
| dc.date.available | 2006-02-03T18:01:44Z | |
| dc.date.issued | 1989 | en_US |
| dc.identifier | UMR4505 | en_US |
| dc.identifier.uri | https://hdl.handle.net/2027.42/6833 | |
| dc.format.extent | 32 bytes | |
| dc.format.extent | 34574 bytes | |
| dc.format.extent | 3366 bytes | |
| dc.format.extent | 39385 bytes | |
| dc.format.extent | 1620870 bytes | |
| dc.format.mimetype | text/plain | |
| dc.format.mimetype | text/plain | |
| dc.format.mimetype | text/plain | |
| dc.format.mimetype | text/plain | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.subject | Traveling-salesman problem. | en_US |
| dc.subject | Integer programming. | en_US |
| dc.subject | Transportation -- Mathematical models. | en_US |
| dc.subject | Mathematical optimization. | en_US |
| dc.title | An efficient transformation of the generalized traveling salesman problem | en_US |
| dc.type | Technical Report | en_US |
| dc.subject.hlbtoplevel | Engineering | en_US |
| dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/6833/5/bam0397.0001.001.pdf | en_US |
| dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/6833/4/bam0397.0001.001.txt | en_US |
| dc.owningcollname | Engineering, College of - Technical Reports |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.