{"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":13,"n_cols":5,"rows_kept":13,"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],[8,2,8,3],[9,2,9,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910872510203321"]
[null,null,"Autore",null,"Baeza-Yates R."]
[null,null,"Titolo",null,"Fifth Mexican International Conference on Computer Science"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified], : IEEE Computer Society Press, 2004"]
[null,null,"Descrizione fisica",null,"1 online resource (xv, 422 pages) : illustrations"]
[null,null,"Disciplina",null,"004.6"]
[null,null,"Soggetti",null,"Computer networks"]
[{"$nulls":4},"Computer science"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Sommario/riassunto","This work presents a comparative analysis of different types of logic cuts obtained using the dual surrogate properties of multidimensional knapsack problems. Constraint pairing and an initial integer solution are used to combine the dual surrogate constraint with the objective function and generate new constraints. These constraints are used to obtain different type of logic cuts and these cuts are included in the model before solving the problem to optimality with branch and bound. Computational tests were performed in the set of small problems and the first subset of big instances in the OR-library. It can be seen that the presence of logic cuts in the model improved the branch and bound performance lowering the number of nodes in the search tree."]