{"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":30,"n_cols":5,"rows_kept":30,"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],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[14,2,14,3],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910141397203321"]
[null,null,"Autore",null,"Luss Hanan"]
[null,null,"Titolo",null,"Equitable resource allocation [[electronic resource] ] : models, algorithms and applications / / Hanan Luss"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, NJ, : Wiley, 2012"]
[null,null,"ISBN",null,"1-118-44921-5"]
[{"$nulls":4},"1-283-64484-3"]
[{"$nulls":4},"1-118-44918-5"]
[{"$nulls":4},"1-118-44924-X"]
[null,null,"Descrizione fisica",null,"1 online resource (371 p.)"]
[null,null,"Collana",null,"Information and communication technology series"]
[null,null,"Classificazione",null,"TEC029000"]
[null,null,"Disciplina",null,"620.0042"]
[{"$nulls":4},"658.4/033"]
[{"$nulls":4},"658.4033"]
[null,null,"Soggetti",null,"Operations research"]
[{"$nulls":4},"Resource allocation"]
[{"$nulls":4},"Electronic books."]
[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 indexes."]
[null,null,"Nota di contenuto",null,"Title page; Copyright page; Contents; Preface; Acknowledgments; 1: Introduction; 1.1 Perspective; 1.2 Equitable Resource Allocation: Lexicographic Minimax (Maximin) Optimization; 1.3 Examples and Applications; 1.3.1 Allocation of High-Tech Components; 1.3.2 Throughput in Communication and Computer Networks; 1.3.3 Point-to-Point Throughput Estimation in Networks; 1.3.4 Bandwidth Allocation for Content Distribution; 1.3.5 Location of Emergency Facilities; 1.3.6 Other Applications; 1.4 Related Fairness Criteria; 1.5 Outline of the Book; 1.5.1 Chapter 2: Nonlinear Resource Allocation"]
[{"$nulls":4},"1.5.2 Chapter 3: Equitable Resource Allocation: Lexicographic Minimax and Maximin Optimization1.5.3 Chapter 4: Equitable Resource Allocation with Substitutable Resources; 1.5.4 Chapter 5: Multiperiod Equitable Resource Allocation; 1.5.5 Chapter 6: Equitable Network Resource Allocation; 1.5.6 Chapter 7: Equitable Resource Allocation with Integer Decisions; 1.6 Concluding Remarks AND LITERATURE REVIEW; 1.6.1 Equitable Allocation of High-Tech Components; 1.6.2 Equitable Throughput in Communication and Computer Networks; 1.6.3 Point-to-Point Throughput Estimation in Networks"]
[{"$nulls":4},"1.6.4 Equitable Bandwidth Allocation for Content Distribution1.6.5 "]
[{"$nulls":4},"Equitable Location of Emergency Facilities; 1.6.6 Other Applications; 2: Nonlinear Resource Allocation; 2.1 Formulation and Optimality Properties; 2.2 Algorithms; 2.2.1 The Activity Deletion Algorithm; 2.2.2 The Activity Addition Algorithm; 2.2.3 The Constraints Evaluation Algorithm; 2.2.4 Lower and Upper Bounds; 2.3 Nonlinear Resource-Usage Constraint; 2.3.1 Formulation and Optimality Properties; 2.3.2 Algorithms; Computational Results; 2.4 Multiple Resource Constraints: A Special Case"]
[{"$nulls":4},"2.5 Concluding Remarks and LITERATURE REVIEW3: Equitable Resource Allocation: Lexicographic Minimax and Maximin Optimization; 3.1 Formulation and Optimality Properties; 3.2 Minimax Algorithms; 3.2.1 The Minimax Activity Deletion Algorithm; 3.2.2 The Minimax Activity Addition Algorithm; 3.2.3 The Minimax Constraints Evaluation Algorithm; 3.2.4 Lower and Upper Bounds; 3.3 The Lexicographic Minimax Algorithm; Computational Results; 3.4 Extension to Nonseparable Objective Function; 3.5 Concluding Remarks and LITERATURE REVIEW; 4: Equitable Resource Allocation with Substitutable Resources"]
[{"$nulls":4},"4.1 Representations of Substitutable Resources4.1.1 Transitive Substitutable Resources Represented by Trees; 4.1.2 Transitive Substitutable Resources Represented by Acyclic Graphs; 4.1.3 Nontransitive Substitutable Resources Represented by Bipartite Graphs; 4.1.4 Activity-Dependent Substitutable Resources Represented by Bipartite Graphs; 4.1.5 Solution Approach; 4.2 Transitive Substitutable Resources Represented by Trees; 4.2.1 Formulation; 4.2.2 The Minimax Algorithm; 4.2.3 The Lexicographic Minimax Algorithm; Computational Results; 4.2.4 Lower and Upper Bounds"]
[{"$nulls":4},"4.3 Transitive Substitutable Resources Represented by Acyclic Graphs"]
[null,null,null,"Sommario/riassunto","\"This book focuses primarily on equitable resource allocation and is a valuable reference to those who work to solve diverse optimization problems\"--"]