A note on finding all shortest paths

LDR 02392cam a2200481I 4500
001 103155362
003 MiAaHDL
005 20240606000000.0
006 m d
007 cr bn ---auaua
008 790127s1972 cou b s000 0 eng d
035 ‡asdr-cou.b1448743
035 ‡a(OCoLC)4591120
040 ‡aUUM ‡beng ‡cUUM ‡dOCLCG ‡dOCLCQ ‡dOCLCO ‡dOCLCF ‡dOCLCQ ‡dOCLCO ‡dOCL
049 ‡aCODG,CODE
050 4 ‡aT57.85 ‡b.G5633
100 1 ‡aGlover, Fred, ‡d1937- ‡0http://id.loc.gov/authorities/names/n88643785 ‡1http://isni.org/isni/0000000108726672.
245 1 2 ‡aA note on finding all shortest paths / ‡cby Fred Glover, D. Klingman [and] A. Napier.
260 ‡aBoulder : ‡bBusiness Research Division, Graduate School of Business Administration, University of Colorado, ‡c1972.
300 ‡a10 pages, 2 unnumbered leaves ; ‡c28 cm.
336 ‡atext ‡btxt ‡2rdacontent.
337 ‡aunmediated ‡bn ‡2rdamedia.
338 ‡avolume ‡bnc ‡2rdacarrier.
490 0 ‡aManagement science report series ; ‡vreport no. 72-12.
500 ‡a"Also released as Research report CS#88 form the Center for Cybernetic Studies, The University of Texas at Austin."
504 ‡aIncludes bibliographical references (leaf 12)
538 ‡aMode of access: Internet.
583 1 ‡acommitted to retain ‡c20160101 ‡d20410101 ‡5CoU ‡fAlliance Shared Trust ‡uhttps://www.coalliance.org/shared-print-archiving-policies.
650 7 ‡aNetwork analysis (Planning) ‡2fast ‡0(OCoLC)fst01036221.
650 0 ‡aNetwork analysis (Planning) ‡vProblems, exercises, etc.
655 7 ‡aProblems and exercises. ‡2fast ‡0(OCoLC)fst01423783.
700 1 ‡aNapier, A., ‡eauthor.
700 1 ‡aKlingman, D. ‡q(Darwin), ‡eauthor. ‡0http://id.loc.gov/authorities/names/n81036471 ‡1http://isni.org/isni/0000000117508116.
CID ‡a103155362
DAT 0 ‡a20200521030326.0 ‡b20240606000000.0
DAT 1 ‡a20240606141527.0 ‡b2024-10-24T17:49:02Z
DAT 2 ‡a2024-10-24T17:30:01Z
CAT ‡aSDR-COU ‡ccou ‡dFOLIO ‡lprepare.pl-004-008
FMT ‡aBK
HOL ‡0sdr-cou.b1448743 ‡acub ‡bSDR ‡cCOU ‡pcub.p103020801005 ‡sCOU ‡1b1448743
974 ‡bCOU ‡cCOU ‡d20241024 ‡sgoogle ‡ucub.p103020801005 ‡y1972 ‡ric ‡qbib ‡tUS bib date1 >= 1929