LEADER 05543oam 2200613 450 001 9910143906203321 005 20210521142351.0 010 $a3-540-47867-1 024 7 $a10.1007/3-540-47867-1 035 $a(CKB)1000000000211733 035 $a(SSID)ssj0000318333 035 $a(PQKBManifestationID)11241974 035 $a(PQKBTitleCode)TC0000318333 035 $a(PQKBWorkID)10310512 035 $a(PQKB)10499252 035 $a(DE-He213)978-3-540-47867-6 035 $a(MiAaPQ)EBC3062287 035 $a(MiAaPQ)EBC6414007 035 $z(PPN)123720389 035 $a(PPN)155223690 035 $a(EXLCZ)991000000000211733 100 $a20210521d2002 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aInteger programming and combinatorial optimization $e9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002 : proceedings /$fWilliam J. Cook, Andreas S. Schulz (eds.) 205 $a1st ed. 2002. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[2002] 210 4$d©2002 215 $a1 online resource (XI, 487 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2337 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43676-6 320 $aIncludes bibliographical references and index. 327 $aA Faster Scaling Algorithm for Minimizing Submodular Functions -- A Generalization of Edmonds? Matching and Matroid Intersection Algorithms -- A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization -- The Quickest Multicommodity Flow Problem -- A New Min-Cut Max-Flow Ratio for Multicommodity Flows -- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems -- Finding the Exact Integrality Gap for Small Traveling Salesman Problems -- Polynomial-Time Separation of Simple Comb Inequalities -- A New Approach to Cactus Construction Applied to TSP Support Graphs -- Split Closure and Intersection Cuts -- An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs -- Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms -- On a Lemma of Scarf -- A Short Proof of Seymour?s Characterization of the Matroids with the Max-Flow Min-Cut Property -- Integer Programming and Arrovian Social Welfare Functions -- Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design -- The Minimum Latency Problem Is NP-Hard for Weighted Trees -- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- A Polyhedral Approach to Surface Reconstruction from Planar Contours -- The Semidefinite Relaxation of the k-Partition Polytope Is Strong -- A Polyhedral Study of the Cardinality Constrained Knapsack Problem -- A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling -- An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem -- On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes -- Hard Equality Constrained Integer Knapsacks -- The Distribution of Values in the Quadratic Assignment Problem -- A New Subadditive Approach to Integer Programming -- Improved Approximation Algorithms for Resource Allocation -- Approximating the Advertisement Placement Problem -- Algorithms for Minimizing Response Time in Broadcast Scheduling -- Building Edge-Failure Resilient Networks -- The Demand Matching Problem -- The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. 330 $aThis volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27?29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2337 606 $aInteger programming$vCongresses 606 $aCombinatorial optimization$vCongresses 615 0$aInteger programming 615 0$aCombinatorial optimization 676 $a519.7/7 702 $aCook$b William J.$f1936- 702 $aSchulz$b Andreas S. 712 12$aConference on Integer Programming and Combinatorial Optimization 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143906203321 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNINA LEADER 03932nam 2200661 450 001 9910791555903321 005 20230721012648.0 010 $a1-4426-8623-5 010 $a1-4426-9786-5 024 7 $a10.3138/9781442697867 035 $a(CKB)2560000000055771 035 $a(EBL)3272883 035 $a(SSID)ssj0000484356 035 $a(PQKBManifestationID)11281322 035 $a(PQKBTitleCode)TC0000484356 035 $a(PQKBWorkID)10574388 035 $a(PQKB)10318441 035 $a(CEL)435068 035 $a(CaBNvSL)slc00226288 035 $a(MiAaPQ)EBC3272883 035 $a(MiAaPQ)EBC4672954 035 $a(DE-B1597)465209 035 $a(OCoLC)1013942824 035 $a(OCoLC)944176534 035 $a(DE-B1597)9781442697867 035 $a(Au-PeEL)EBL4672954 035 $a(CaPaEBR)ebr11258604 035 $a(OCoLC)707712987 035 $a(EXLCZ)992560000000055771 100 $a20160923e20091982 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aFighting words $eimperial censorship and the Russian press, 1804-1906 /$fCharles A. Ruud 205 $aWith a New Introduction 210 1$aToronto, Ontario ;$aBuffalo, New York ;$aLondon, England :$cUniversity of Toronto Press,$d2009. 210 4$d©1982 215 $a1 online resource (352 p.) 300 $aFirst ed. published 1982. 311 $a1-4426-1024-7 320 $aIncludes bibliographical references and index. 327 $tFrontmatter -- $tContents -- $tPreface -- $tIntroduction to the 2009 edition -- $tIntroduction -- $t1. The European pattern and the beginnings of Russian censorship -- $t2. The early administrative system and the rise of mysticism, 1801-17 -- $t3. Golitsyn's fall and the decline of mysticism, 1817-25 -- $t4. Nicholas I's censorship innovations, 1825-32 -- $t5. Censorship and the new journalism, 1832-48 -- $t6. A system under siege, 1848-55 -- $t7. Confused steps towards reform, 1855-61 -- $t8. The dilemmas of liberal censorship, 1862-63 -- $t9. The reform of 6 April 1865 -- $t10. The first year of the reformed system, 1865-66 -- $t11. Control of press freedom: warnings, court cases, and libel laws, 1867-69 -- $t12. Censorship repression and the emergence of a 'European' press, 1869-89 -- $t13. The last years of the administrative system, 1889-1906 -- $t14. Autocracy and the press: the historic conflict -- $tAppendices -- $tNotes -- $tBibliography -- $tIndex 330 $aCensorship took many forms in Imperial Russia. First published in 1982, Fighting Words focuses on the most common form: the governmental system that screened written works before or after publication to determine their acceptability. Charles A. Ruud shows that, despite this system, the nineteenth-century Russian Imperial government came to grant far more extensive legal publishing freedoms than most Westerners realize, adopting a more liberal attitude towards the press by permitting it a position recognized by law. Fighting Words also reveals, however, that the government fell far short of implementing these reforms, thus contributing to the growth of opposition to the Tsarist regime in the second half of the nineteenth century and the first few years of the twentieth. Now back in print with a new introduction by the author, Fighting Words is a classic work offering insight into the press, censorship, and the limits of printed expression in Imperial Russia. 606 $aCensorship$zRussia$xHistory$y19th century 606 $aFreedom of the press$zRussia$xHistory$y19th century 615 0$aCensorship$xHistory 615 0$aFreedom of the press$xHistory 676 $a363.3/1/0947 700 $aRuud$b Charles A.$f1933-$01503941 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910791555903321 996 $aFighting words$93732668 997 $aUNINA