02404nam 2200577 a 450 991083001740332120230725035214.01-118-60024-X1-118-60023-11-299-18744-71-118-60019-3(CKB)2670000000333521(EBL)1120647(OCoLC)828299067(SSID)ssj0001034478(PQKBManifestationID)11975736(PQKBTitleCode)TC0001034478(PQKBWorkID)11014852(PQKB)10258836(MiAaPQ)EBC1120647(EXLCZ)99267000000033352120130301d2010 uy 0engur|n|---|||||txtccrConcepts of combinatorial optimization[electronic resource] /edited by Vangelis Th. PaschosLondon ISTE ;Hoboken, N.J. Wiley20101 online resource (382 p.)ISTECombinatorial optimization ;v. 1Description based upon print version of record.1-84821-147-3 Includes bibliographical references and index.pt. I. Complexity of combinatorial optimization problems -- pt. II. Classical solution methods -- pt. III. Elements from mathematical programming.Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts:On the complexity of combinatorial optimization problems, that presents basics aISTECombinatorial optimizationProgramming (Mathematics)Combinatorial optimization.Programming (Mathematics)519.64Paschos Vangelis Th944252MiAaPQMiAaPQMiAaPQBOOK9910830017403321Concepts of combinatorial optimization4040268UNINA