Welcome to our new digital collections platform!
This system is still under development and we welcome any and all feedback. If you have suggestions, want to report an issue, or provide general feedback, please complete this form.

reports -- #382 The M-Traveling Salesmen Problem: A Duality Based Branch-and-Bound Algorithm

Author

Date

August 1980

Collection

Series

CCS Research Reports

Folder Title

Folder 26

Extent

1 item

Language

Rights

Genre

Original Repository

Carnegie Mellon University Archives

Persistent Link

http://doi.library.cmu.edu/10.1184/pmc/cooper/box00017/fld00026/bdl0001/doc0002

Subjects

Subject (Topic)

management science

Subject (Name)

University of Texas. Center for Cybernetic Studies
Carnegie Mellon University. School of Urban and Public Affairs

Archival Collection Information

Series

CCS Research Reports

Box Number

17

Folder Number

26

Folder Title

Folder 26

Document Number

2

Tools & Related Links

Access in Person

Takedown Notice

Historical documents and their descriptions may contain harmful or offensive language. We are working to do better. Learn more about our efforts here.

Learn more about the collection

Need Assistance?