LEADER 04231oam 2200637I 450 001 9910455629003321 005 20200520144314.0 010 $a1-134-44019-7 010 $a0-415-28917-3 010 $a1-134-44020-0 010 $a1-280-10647-6 010 $a0-203-21807-8 024 7 $a10.4324/9780203218075 035 $a(CKB)111087026854986 035 $a(StDuBDS)AH3704679 035 $a(SSID)ssj0000304135 035 $a(PQKBManifestationID)11263575 035 $a(PQKBTitleCode)TC0000304135 035 $a(PQKBWorkID)10278013 035 $a(PQKB)10095223 035 $a(MiAaPQ)EBC171370 035 $a(Au-PeEL)EBL171370 035 $a(CaPaEBR)ebr10101000 035 $a(CaONFJC)MIL10647 035 $a(OCoLC)181597977 035 $a(OCoLC)53016938 035 $a(EXLCZ)99111087026854986 100 $a20180331d2003 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aNerva and the Roman succession crisis of AD 96-99 /$fJohn D. Grainger 210 1$aLondon ;$aNew York :$cRoutledge,$d2003. 215 $a1 online resource (xxvii, 162 p. ) $cill., maps 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a0-415-34958-3 311 $a0-203-29466-1 320 $aIncludes bibliographical references and index. 327 $a1. Assassination -- 2. Conspiracy -- 3. Nerva -- 4. Reactions -- 5. The emperor's work -- 6. The succession problem -- 7. The aristocratic networks -- 8. Choice -- 9. Heir -- 10. New emperor. 330 $aThis is a detailed examination of the crisis of AD 96-99 which saw the transfer of power from Domitian to Trajan and passing through the feeble hands of Nerva. 330 $bThe imperial succession at Rome was notoriously uncertain, and where possible hereditary succession was preferred. John Grainger's detailed study looks at aperiod of intrigue and conspiracy. He explores how, why and by whom Domitian was killed, the rule of Nerva, chosen to succeed him, and finally Nerva's own choice of successor, Trajan, who became a strong and respected emperor against the odds. Perhaps most significantly Grainger investigates the effects of this dynastic uncertainty both inside and outside the ruling group in Rome, asking why civil war did not occur in this time of political upheaval. The last time a dynasty had failed, in AD 68, a damaging military conflict had resulted; at the next failure in AD 192, another war broke out; by the third century civil war was institutionalized, and was one of the main reasons for the eventual downfall of the entire imperial structure. Grainger argues that though AD 96-98 stands out as the civil war that did not happen, it was a perilously close-run thing. The imperial succession at Rome was notoriously uncertain, and where possible hereditary succession was preferred. John Grainger's detailed study looks at aperiod of intrigue and conspiracy. He explores how, why and by whom Domitian was killed, the rule of Nerva, chosen to succeed him, and finally Nerva's own choice of successor, Trajan, who became a strong and respected emperor against the odds. Perhaps most significantly Grainger investigates the effects of this dynastic uncertainty both inside and outside the ruling group in Rome, asking why civil war did not occur in this time of political upheaval. The last time a dynasty had failed, in AD 68, a damaging military conflict had resulted; at the next failure in AD 192, another war broke out; by the third century civil war was institutionalized, and was one of the main reasons for the eventual downfall of the entire imperial structure. Grainger argues that though AD 96-98 stands out as the civil war that did not happen, it was a perilously close-run thing. 606 $aEmperors$zRome$vBiography 607 $aRome$xHistory$yAntonines, 96-192 608 $aElectronic books. 615 0$aEmperors 676 $a937.07092 700 $aGrainger$b John D.$f1939,$0956272 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455629003321 996 $aNerva and the Roman succession crisis of AD 96-99$92165225 997 $aUNINA LEADER 06252nam 22009253u 450 001 9910954506603321 005 20240405033423.0 010 $a9781118626863 010 $a1118626869 010 $a9781118627372 010 $a1118627377 010 $a9781118627259 010 $a1118627253 035 $a(CKB)2550000001349249 035 $a(EBL)1776322 035 $a(SSID)ssj0001371257 035 $a(PQKBManifestationID)11754302 035 $a(PQKBTitleCode)TC0001371257 035 $a(PQKBWorkID)11301284 035 $a(PQKB)10806385 035 $a(MiAaPQ)EBC1776322 035 $a(OCoLC)975045031 035 $a(FINmELB)ELB178655 035 $a(Perlego)1007711 035 $a(EXLCZ)992550000001349249 100 $a20140908d2014|||| u|| | 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aInteger and Combinatorial Optimization 205 $a1st ed. 210 $aHoboken $cWiley$d2014 210 1$aNew York :$cJohn Wiley & Sons, Inc.,$d1999. 210 4$dİ1999 215 $a1 online resource (783 p.) 225 1 $aWiley Series in Discrete Mathematics and Optimization 300 $aDescription based upon print version of record. 311 08$a9780471359432 311 08$a0471359432 311 08$a9781322094717 311 08$a1322094713 320 $aIncludes bibliographical references and indexes. 327 $aCover ; 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 327 $a4. 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 327 $aDual Simplex Algorithm Dual Simplex Algorithm (phase 2) ; The 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 327 $aAugmenting 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 327 $a6. 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 327 $aSection I.5.3 330 $aRave 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 410 0$aWiley Series in Discrete Mathematics and Optimization 606 $aCombinatorial optimization 606 $aInteger programming 606 $aMathematical optimization 606 $aMathematical optimization 606 $aInteger programming 606 $aCombinatorial optimization 606 $aCivil & Environmental Engineering$2HILCC 606 $aEngineering & Applied Sciences$2HILCC 606 $aOperations Research$2HILCC 615 4$aCombinatorial optimization. 615 4$aInteger programming. 615 4$aMathematical optimization. 615 0$aMathematical optimization. 615 0$aInteger programming. 615 0$aCombinatorial optimization. 615 7$aCivil & Environmental Engineering 615 7$aEngineering & Applied Sciences 615 7$aOperations Research 676 $a519.7/7 700 $aWolsey$b Laurence A$0104519 701 $aNemhauser$b George L$065489 801 0$bAU-PeEL 801 1$bAU-PeEL 801 2$bAU-PeEL 906 $aBOOK 912 $a9910954506603321 996 $aInteger and combinatorial optimization$91538976 997 $aUNINA