LEADER 02615nam 2200649 a 450 001 9910139246303321 005 20200520144314.0 010 $a1-118-55756-5 010 $a1-299-31543-7 010 $a1-118-61966-8 035 $a(CKB)2560000000100624 035 $a(EBL)1143621 035 $a(OCoLC)830161655 035 $a(SSID)ssj0000832662 035 $a(PQKBManifestationID)11501378 035 $a(PQKBTitleCode)TC0000832662 035 $a(PQKBWorkID)10900229 035 $a(PQKB)10228014 035 $a(MiAaPQ)EBC1143621 035 $a(Au-PeEL)EBL1143621 035 $a(CaPaEBR)ebr10671498 035 $a(CaONFJC)MIL462793 035 $a(EXLCZ)992560000000100624 100 $a20091218d2010 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAnt colony optimization and constraint programming$b[electronic resource] /$fChristine Solnon 210 $aLondon $cISTE ;$aHoboken, N.J. $cWiley$d2010 215 $a1 online resource (248 p.) 225 1 $aISTE 300 $aDescription based upon print version of record. 311 $a1-84821-130-9 320 $aIncludes bibliographical references (p. 219-230) and index. 327 $apt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO. 330 $aAnt colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search 410 0$aISTE 606 $aConstraint programming (Computer science) 606 $aMathematical optimization 606 $aSwarm intelligence 606 $aAnt algorithms 608 $aElectronic books. 615 0$aConstraint programming (Computer science) 615 0$aMathematical optimization. 615 0$aSwarm intelligence. 615 0$aAnt algorithms. 676 $a005.1/16 700 $aSolnon$b Christine$0860417 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910139246303321 996 $aAnt colony optimization and constraint programming$91919745 997 $aUNINA