{"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":24,"n_cols":5,"rows_kept":24,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991001266149707536"]
[null,null,"Autore",null,"Schrijver, Alexander"]
[null,null,"Titolo",null,"Combinatorial optimization : polyhedra and efficiency / Alexander Schrijver"]
[null,null,"Pubbl/distr/stampa",null,"Berlin : Springer, c2003"]
[null,null,"ISBN",null,"3540443894"]
[null,null,"Descrizione fisica",null,"3 v. ([104], 1881 p.) : ill. ; 24 cm"]
[null,null,"Collana",null,"Algorithms and combinatorics, 0937-5511 ; 24"]
[null,null,"Classificazione",null,"AMS 90-XX"]
[{"$nulls":4},"AMS 90C27"]
[{"$nulls":4},"AMS 90C35"]
[{"$nulls":4},"AMS 05C"]
[{"$nulls":4},"AMS 05C85"]
[{"$nulls":4},"AMS 68R05"]
[{"$nulls":4},"AMS 68Q25"]
[{"$nulls":4},"LC QA402.5.S3535"]
[null,null,"Disciplina",null,"519.3"]
[null,null,"Soggetti",null,"Combinatorial optimization"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [1463]-1766) and indexes"]
[null,null,"Nota di contenuto",null,"V. A.: Paths, flows, matchings"]
[{"$nulls":4},"V. B.: Matroids, trees, stable sets"]
[{"$nulls":4},"V. C.: Disjoint paths, hypergraphs"]