{"text_format":"5","workbook":"xls","n_sheets":1,"sheets":["report2"],"props":{"last_modified_by":"sharecat"},"not_rendered":{"external_links":1,"defined_names":1},"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910819597103321"]
[null,null,"Autore",null,"Solnon Christine"]
[null,null,"Titolo",null,"Ant colony optimization and constraint programming [[electronic resource] /] / Christine Solnon"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, N.J., : Wiley, 2010"]
[null,null,"ISBN",null,"1-118-55756-5"]
[{"$nulls":4},"1-299-31543-7"]
[{"$nulls":4},"1-118-61966-8"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (248 p.)"]
[null,null,"Collana",null,"ISTE"]
[null,null,"Disciplina",null,"005.1/16"]
[null,null,"Soggetti",null,"Constraint programming (Computer science)"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Swarm intelligence"]
[{"$nulls":4},"Ant algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[{"$nulls":3},"Livello bibliografico","Monografia"]
[{"$nulls":3},"Note generali","Description based upon print version of record."]
[{"$nulls":3},"Nota di bibliografia","Includes bibliographical references (p. 219-230) and index."]
[null,null,"Nota di contenuto",null,"pt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO."]
[{"$nulls":3},"Sommario/riassunto","Ant 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"]