{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"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],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[14,2,14,3],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910830397103321"]
[null,null,"Autore",null,"Lorca Xavier"]
[null,null,"Titolo",null,"Tree-based graph partitioning constraint [[electronic resource] /] / Xavier Lorca"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, N.J., : Wiley, 2011"]
[null,null,"ISBN",null,"1-118-60430-X"]
[{"$nulls":4},"1-299-14154-4"]
[{"$nulls":4},"1-118-60447-4"]
[{"$nulls":4},"1-118-60360-5"]
[null,null,"Descrizione fisica",null,"1 online resource (252 p.)"]
[null,null,"Collana",null,"ISTE"]
[null,null,"Classificazione",null,"MAT029000"]
[null,null,"Disciplina",null,"005.1/16"]
[{"$nulls":4},"005.116"]
[null,null,"Soggetti",null,"Constraint programming (Computer science)"]
[{"$nulls":4},"Graph theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"pt. 1. Constraint programming and foundations of graph theory -- pt. 2. Characterization of tree-based graph partitioning constraints -- pt. 3. Implementation : task planning -- pt. 4. Conclusion and future work."]
[null,null,null,"Sommario/riassunto","Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Nevertheless, these problems are not based on the same partitioning pattern: generally, patterns like cycles, paths, or trees are distinguished. Moreover, the practical applications are often not limited to theoretical problems like the Hamiltonian path problem, or K-node disjoint path problems. Indeed, they usually combine the graph partitioning problem with sever"]