Linear network optimization : algorithms and codes /
Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass. :
MIT Press,
1991
Cambridge, Mass. : c1991 Cambridge, Mass. : c1991 Cambridge, Mass. : [1991] |
| Subjects: |
| LEADER | 06903nam a2201237 a 4500 | ||
|---|---|---|---|
| 001 | 86824310-a255-4c28-98c3-020dcd9619cc | ||
| 005 | 20240926000000.0 | ||
| 008 | 910708t19911991maua b 001 0 eng | ||
| 010 | |a 91027588 | ||
| 010 | |a 91027588 | ||
| 010 | |a 91027588 | ||
| 010 | |a 91027588 | ||
| 020 | |a 0262023342 | ||
| 020 | |a 9780262023344 | ||
| 035 | |9 ADH8648TS | ||
| 035 | |9 AFW4096CU | ||
| 035 | |a (CStRLIN)DCLC9127588-B | ||
| 035 | |a (CStRLIN)NJPG92-B46979 | ||
| 035 | |a (CStRLIN)NYCG92-B915 | ||
| 035 | |a (ICU)BID15565005 | ||
| 035 | |a (MCM)000590958 | ||
| 035 | |a (MCM)000590958MIT01 | ||
| 035 | |a (MdBJ)765985 | ||
| 035 | |a (NNC)1054777 | ||
| 035 | |a (NcD)001012706DUK01 | ||
| 035 | |a (NhD)b12545107-01dcl_inst | ||
| 035 | |a (NjP)742015-princetondb | ||
| 035 | |a (OCoLC)24174612 | ||
| 035 | |a (OCoLC)ocm24174612 |9 ExL | ||
| 035 | |a (OCoLC)ocm24174612 | ||
| 035 | |a (OCoLC-I)274235612 | ||
| 035 | |a (OCoLC-M)24174612 | ||
| 035 | |a (PU)2762094-penndb-Voyager | ||
| 035 | |a (Sirsi) AKW2035 | ||
| 035 | |a 1054777 | ||
| 035 | |a 24174612 | ||
| 035 | |a 2762094 | ||
| 035 | |a 765985 | ||
| 035 | |a AEK6071EI | ||
| 035 | |a TAPE | ||
| 035 | |b b12545107 | ||
| 035 | |z (NjP)Voyager742015 | ||
| 040 | |a DLC |b eng |c DLC |d DLC | ||
| 040 | |a DLC |b eng |c DLC |d NDD | ||
| 040 | |a DLC |c DLC |d DLC |d OrLoB | ||
| 040 | |a DLC |c DLC |d DLC | ||
| 040 | |a DLC |c DLC |d GHG |d MYG | ||
| 040 | |a DLC |c DLC |d MdBJ | ||
| 040 | |a DLC |c DLC |d NNC | ||
| 041 | 0 | |a eng | |
| 049 | |a JHEE | ||
| 049 | |a MYGG | ||
| 050 | 4 | |a T57.85 |b .B43 1991 | |
| 050 | 0 | 0 | |a T57.85 |b .B43 1991 |
| 050 | 9 | 9 | |a T57.85 |b .B43 1991 |
| 082 | 0 | 0 | |a 658.4/032 |2 20 |
| 090 | |a T57.85 |b .B43 1991 | ||
| 099 | |a T57.85.B43 1991 | ||
| 100 | 1 | |a Bertsekas, Dimitri P |1 http://viaf.org/viaf/19752241 | |
| 100 | 1 | |a Bertsekas, Dimitri P | |
| 245 | 1 | 0 | |a Linear network optimization : |b algorithms and codes / |c Dimitri P. Bertsekas |
| 260 | |a Cambridge, Mass. : |b MIT Press, |c 1991 | ||
| 260 | |a Cambridge, Mass. : |b MIT Press, |c c1991 | ||
| 260 | 0 | |a Cambridge, Mass. : |b MIT Press, |c c1991 | |
| 263 | |a 9111 | ||
| 264 | 1 | |a Cambridge, Mass. : |b MIT Press, |c [1991] | |
| 264 | 4 | |c ©1991 | |
| 300 | |a xi, 359 p. : |b ill. ; |c 24 cm | ||
| 300 | |a xi, 359 pages : |b illustrations ; |c 24 cm | ||
| 336 | |a text |2 rdacontent | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a unmediated |2 rdamedia | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a volume |2 rdacarrier | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (p. 343-355) and index | ||
| 504 | |a Includes bibliographical references (pages 343-355) and index | ||
| 504 | |a Includes bibliographical references and index | ||
| 520 | |a Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems | ||
| 599 | |a GRSN 590958 | ||
| 650 | 0 | |a Algorithms | |
| 650 | 0 | |a Mathematical optimization | |
| 650 | 0 | |a Network analysis (Planning) | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Mathematical optimization |2 fast | |
| 650 | 7 | |a Network analysis (Planning) |2 fast | |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l a2151673 |s US-CST |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 1314430 |s US-ICU |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 990005909580106761 |s US-MCM |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 991025975679707861 |s US-MDBJ |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 990010127060108501 |s US-NCD |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 991003776759705706 |s US-NHD |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 997420153506421 |s US-NJP |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 1054777 |s US-NNC |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 0 | |i 86824310-a255-4c28-98c3-020dcd9619cc |l 9927620943503681 |s US-PU |m linear_network_optimizationalgorithms_and_codes____________________________1991_______mitpra________________________________________bertsekas__dimitri_p_______________p |
| 999 | 1 | 1 | |l a2151673 |s ISIL:US-CST |t BKS |b 523995f0-ac68-5353-a4a1-e39606ad7f81 |y 523995f0-ac68-5353-a4a1-e39606ad7f81 |p UNLOANABLE |
| 999 | 1 | 1 | |l a2151673 |s ISIL:US-CST |t BKS |a SAL3-STACKS |b 36105001698989 |c T57.85 .B43 1991 |d Library of Congress classification |k 1 |x book |y 36105001698989 |p UNLOANABLE |
| 999 | 1 | 1 | |l 1314430 |s ISIL:US-ICU |t BKS |a JCL-Sci |b 36135485 |c T57.85.B430 1991 |d Library of Congress classification |y 2643077 |p LOANABLE |
| 999 | 1 | 1 | |l 990005909580106761 |s ISIL:US-MCM |t BKS |a ENG MOLDREMEDY |b 39080007207092 |c T57.85.B43 1991 |d 0 |x BOOK |y 23515269470006761 |p UNLOANABLE |
| 999 | 1 | 1 | |l 991025975679707861 |s ISIL:US-MDBJ |t BKS |a LSC shmoffs |b 31151037772302 |c T 57.85 .B431 1991 |d 0 |x jhbooks |y 23371240000007861 |p LOANABLE |
| 999 | 1 | 1 | |l 990010127060108501 |s ISIL:US-NCD |t BKS |a FORD FRD |b F00026163I |c T57.85 .B43 1991 |d 0 |x BOOK |y 23604135760008501 |p UNLOANABLE |
| 999 | 1 | 1 | |l 990010127060108501 |s ISIL:US-NCD |t BKS |a PERKN PK |b D00247625Q |c T57.85 .B43 1991 |d 0 |x BOOK |y 23604135780008501 |p LOANABLE |
| 999 | 1 | 1 | |l 991003776759705706 |s ISIL:US-NHD |t BKS |a LCSF LCSF |b 33311000342289 |c T57.85 .B43 1991 |d 0 |x BOOK |y 23144496840005706 |p LOANABLE |
| 999 | 1 | 1 | |l 997420153506421 |s ISIL:US-NJP |t BKS |a engineer stacks |b 32101021557002 |c T57.85 .B43 1991 |d 0 |x Gen |y 23512221100006421 |p UNLOANABLE |
| 999 | 1 | 1 | |l 1054777 |s ISIL:US-NNC |t BKS |a off,eng |b CU71996028 |c T57.85 .B43 1991 |y 1519883 |p LOANABLE |
| 999 | 1 | 1 | |l 9927620943503681 |s ISIL:US-PU |t BKS |a Libra stor |b 31198058938585 |c T57.85 .B43 1991 |d 0 |x BOOK |y 23300349840003681 |p LOANABLE |