MARC Record from marc_columbia

LEADER: 02172cam a2200421Mi 4500
001 14727712
005 20220521232345.0
006 m o d
007 cr cn|||||||||
008 170919s2017 enk o 000 0 eng d
035 $a(OCoLC)on1004355422
035 $a(NNC)14727712
040 $aCRCPR$beng$erda$epn$cCRCPR$dIDEBK$dOCLCQ$dUWO$dTYFRS$dOCLCO$dOCLCF$dOCLCQ$dOCLCO$dK6U$dOCLCQ$dOCLCO
020 $a9781351426688$q(e-book ;$qPDF)
020 $a1351426680
035 $a(OCoLC)1004355422
050 4 $aQA166$b.E936 2017
082 04 $a658.4032
049 $aZCUA
100 1 $aEvans, James,$eauthor.
245 10 $aOptimization Algorithms for Networks and Graphs, Second Edition /$cJames Evans.
250 $aSecond edition.
264 1 $aLondon :$bTaylor and Francis,$c2017.
300 $a1 online resource :$btext file, PDF
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
520 2 $a"A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm"--Provided by publisher
505 0 $aChapter 1 Introduction to Graphs and Networks -- chapter 2 Computer Representation and Solution -- chapter 3 Tree Algorithms -- chapter 4 Shortest-Path Algorithms -- chapter 5 Minimum-Cost Flow Algorithms -- chapter 6 Maximum-Flow Algorithms -- chapter 7 Matching and Assignment Algorithms -- chapter 8 The Postman and Related Arc Routing Problems -- chapter 9 The Traveling Salesman and Related Vertex Routing Problems -- chapter 10 Location Problems -- chapter 11 Project Networks.
650 0 $aAlgorithms.
650 2 $aAlgorithms
650 6 $aAlgorithmes.
650 7 $aalgorithms.$2aat
650 7 $aAlgorithms.$2fast$0(OCoLC)fst00805020
655 4 $aElectronic books.
776 08 $z9780203744871$z9781351426688
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio14727712$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS