{"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":22,"n_cols":5,"rows_kept":22,"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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[10,2,10,3],[11,2,11,3],[15,2,15,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910784521103321"]
[null,null,"Titolo",null,"Combinatorial and global optimization [[electronic resource] /] / editors, Panos M. Pardalos, Athanasios Migdalas, Rainer E. Burkard"]
[null,null,"Pubbl/distr/stampa",null,"River Edge, NJ, : World Scientific, c2002"]
[null,null,"ISBN",null,"981-277-821-7"]
[null,null,"Descrizione fisica",null,"1 online resource (373 p.)"]
[null,null,"Collana",null,"Series on applied mathematics ; ; vol. 14"]
[null,null,"Disciplina",null,"511/.6"]
[null,null,"Soggetti",null,"Combinatorial optimization"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Nonlinear programming"]
[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."]
[null,null,"Nota di contenuto",null,"Contents; Preface; A Forest Exterior Point Algorithm for Assignment Problems; 1 Introduction; 2 Preliminaries; 3 Description of the algorithm; 4 Correctness and complexity of the algorithm; 5 Concluding remarks; References"]
[{"$nulls":4},"A Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization 1 Introduction; 2 Genetic scatter search and tabu search approach; 3 HSGT algorithm description; 4 Weight computations; 5 Computational results; 6 Conclusions and recommendations"]
[{"$nulls":4},"Appendix A: Test functions References; Exact Rates of Prokhorov Convergence under Three Moment Conditions; 1 Main result; 2 Outline of proof; References; Location/Allocation of Queuing Facilities in Continuous Space using Minisum and Minimax Criteria                                                                                                       ; 1 Introduction"]
[{"$nulls":4},"2 The model 3 A solution method; 4 Computational results; 5 Conclusions; References; Algorithms for the Consistency Analysis in Scenario Projects; 1 Introduction; 2 Definitions; 3 Complexity ; 4 Algorithms ; 5 Conclusions ; References"]
[{"$nulls":4},"Assignment of Reusable and Non-Reusable Frequencies 1 Introduction; 2 Definitions and techniques; 3 The complexity of radio coloring and radio labeling; 4 An exact algorithm for constant number of colors ; 5 Algorithms for on-line radio labeling                                               ; 6 Open problems ; References"]
[{"$nulls":4},"Image Space Analysis for Vector Optimization and Variational Inequalities. Scalarization"]
[null,null,null,"Sommario/riassunto","Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated"]