Sangam: A Confluence of Knowledge Streams

A minimum 1-arborescence algorithm for non-symetric carrier-dispatching problems

Show simple item record

dc.creator Wan, Peter Jin-Her
dc.date 2011-04-01T16:59:02Z
dc.date 2011-04-01T16:59:02Z
dc.date 1972
dc.date 1972
dc.date 2010
dc.date.accessioned 2023-04-10T10:08:45Z
dc.date.available 2023-04-10T10:08:45Z
dc.identifier http://hdl.handle.net/2097/8173
dc.identifier.uri http://localhost:8080/xmlui/handle/CUHPOERS/285419
dc.description Digitized by Kansas Correctional Industries
dc.format application/pdf
dc.language en_US
dc.publisher Kansas State University
dc.rights This volume was digitized and made accessible online due to deterioration of the original print copy. If you are the author of this work and would like to have online access removed, please contact the Library Administration Office, 785-532-7400, library@k-state.edu.
dc.title A minimum 1-arborescence algorithm for non-symetric carrier-dispatching problems
dc.type Thesis


Files in this item

Files Size Format View
LD2668R41972W349.pdf 10.68Mb application/pdf View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse