{"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":28,"n_cols":5,"rows_kept":28,"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],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[16,2,16,3],[17,2,17,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910791157203321"]
[null,null,"Autore",null,"Wolsey Laurence A"]
[null,null,"Titolo",null,"Integer and Combinatorial Optimization [[electronic resource]]"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, : Wiley, 2014"]
[null,null,"ISBN",null,"1-118-62686-9"]
[{"$nulls":4},"1-118-62737-7"]
[{"$nulls":4},"1-118-62725-3"]
[null,null,"Descrizione fisica",null,"1 online resource (783 p.)"]
[null,null,"Collana",null,"Wiley Series in Discrete Mathematics and Optimization"]
[null,null,"Disciplina",null,"519.7/7"]
[null,null,"Soggetti",null,"Combinatorial optimization"]
[{"$nulls":4},"Integer programming"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Civil & Environmental Engineering"]
[{"$nulls":4},"Engineering & Applied Sciences"]
[{"$nulls":4},"Operations Research"]
[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,"Nota di contenuto",null,"Cover ; Title Page ; Copyright ; Preface ; Contents ; Part I: Foundations ; I.1 The Scope of Integer and Combinatorial Optimization  ; 1. Introduction ; 2. Modeling with Binary Variables I: Knapsack, Assignmentand Matching, Covering, Packing and Partitioning ; The 0-1 Knapsack Problem ; The Assignment and Matching Problems ; Set-covering, Set-packing, and Set-partitioning Problems ; 3. Modeling with Binary Variables II: Facility Location, Fixed-charge Network Flow, and Traveling Salesman ; Facility Location Problems ; The Fixed-charge Network Flow Problem ; The Traveling Salesman Problem"]
[{"$nulls":4},"4. Modeling with Binary Variables III: Nonlinear Functions and Disjunctive ConstraintsPiecewise Linear Functions ; Disjunctive Constraints ; A Scheduling Problem ; 5. Choices in Model Formulation ; 6. Preprocessing ; Tightening Bounds ; Adding Logical Inequalities, Fixing Variables, and Removing Redundant Constraints ; 7. Notes ; Section I.1.1 ; Sections I.1.2-I.1.4 ; Section I.1.5 ; Section I.1.6 ; 8. Exercises ; I.2: Linear Programming ; 1. Introduction ; 2. Duality ; 3. The Primal and Dual Simplex Algorithms ; Bases and Basic Solutions ; Changing the Basis ; Primal Simplex Algorithm"]
[{"$nulls":4},"Dual Simplex Algorithm Dual Simplex Algorithm (phase 2) ; The "]
[{"$nulls":4},"Simplex Algorithm with Simple Upper Bounds ; Addition of Constraints or Variables ; 4. Subgradient Optimization ; The Subgradient Algorithm for (4.1) ; 5. Notes ; Sections I.2.1-i.2.3. ; Section I.2.4 ; I.3: Graphs and Networks ; 1. Introduction ; 2. The Minimum-weight or Shortest-path Problem ; Dijkstra''s Minimum-weight Path Algorithm ; Bellman-ford Minimum-weight Path Algorithm ; 3. The Minimum-weight Spanning Tree Problem ; Algorithm for Constructing a Spanning Tree ; 4. The Maximum-flow and Minimum-cut Problems"]
[{"$nulls":4},"Augmenting Path Algorithm 5. The Transportation Problem: A Primal-dual Algorithm  ; Primal-dual Algorithm for the Transportation Problem ; Minimum-cost Path Augmentation Algorithm ; 6. A Primal Simplex Algorithm for Network Flow Problems ; 7. Notes ; Section I.3.1 ; Section I.3.2 ; Section I.3.3 ; Section I.3.4 ; Section I.3.5 ; Section I.3.6 ; I.4: Polyhedral Theory ; 1. Introduction and Elementary Linear Algebra ; 2. Definitions of Polyhedra and Dimension ; 3. Describing Polyhedra by Facets ; 4. Describing Polyhedra by Extreme Points and Extreme Rays ; 5. Polarity"]
[{"$nulls":4},"6. Polyhedral Ties Between Linear and Integer Programs 7. Notes ; Sections I.4.1-I.4.4 ; Section I.4.5 ; Section I.4.6 ; 8. Exercises ; 1.5: Computational Complexity ; 1. Introduction ; 2. Measuring Algorithm Efficiency and Problem Complexity ; 3. Some Problems Solvable in Polynomial Time ; 4. Remarks on 0-1 and Pure-integer Programming ; 5. Nondeterministic Polynomial-time Algorithms and Np Problems ; Certificates of Feasibility, the Class Np, and Nondeterministic Algorithms ; 6. The Most Difficult Np Problems: the Class Np ; 7. Complexity and Polyhedra ; 8. Notes ; Sections I.5.1 and I.5.2"]
[{"$nulls":4},"Section I.5.3"]
[null,null,null,"Sommario/riassunto","Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION\"\"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.\"\"-Optima\"\"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for"]