00939nam0 2200265 450 00002398420090305143628.020090305d1959----km-y0itay50------bafreCHy-------001yy<<L'>>économie mondiale aux 19. et 20. sièclesWilhelm RöpkeGenèveLibrairie E. Droz1959235 p.24 cmPublications de l'Institut universitaire de hautes études internationales322001Publications de l'Institut universitaire de hautes études internationales<<L'>>économie mondiale aux 19. et 20. siècles44787EconomiaSec. 20.330.90419Röpke,Wilhelm374845ITUNIPARTHENOPE20090305RICAUNIMARC000023984041/201191NAVA22009Économie mondiale aux 19. et 20. siècles44787UNIPARTHENOPE06514nam 22007695 450 99646561650331620200705205250.03-540-68453-010.1007/3-540-61310-2(CKB)1000000000234461(SSID)ssj0000324036(PQKBManifestationID)11236832(PQKBTitleCode)TC0000324036(PQKBWorkID)10303680(PQKB)10464644(DE-He213)978-3-540-68453-4(PPN)155180428(EXLCZ)99100000000023446120121227d1996 u| 0engurnn|008mamaatxtccrInteger Programming and Combinatorial Optimization[electronic resource] 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings /edited by William H. Cunningham, S. Thomas McCormick, Maurice Queyranne1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (X, 514 p. 18 illus.) Lecture Notes in Computer Science,0302-9743 ;1084Bibliographic Level Mode of Issuance: Monograph3-540-61310-2 Colourful linear programming -- Test sets and inequalities for integer programs -- An optimal, stable continued fraction algorithm for arbitrary dimension -- Algorithms and extended formulations for one and two facility network design -- Integer multicommodity flow problems -- A heuristic algorithm for the set covering problem -- An ?-Relaxation method for generalized separable convex cost network flow problems -- Finding real-valued single-source shortest paths in o(n 3) expected time -- A network-flow technique for finding low-weight bounded-degree spanning trees -- Approximating k-set cover and complementary graph coloring -- On minimum 3-cuts and approximating k-cuts using Cut Trees -- Primal-dual approximation algorithms for feedback problems in planar graphs -- Cone-LP's and semidefinite programs: Geometry and a simplex-type method -- Quadratic knapsack relaxations using cutting planes and semidefinite programming -- A semidefinite bound for mixing rates of Markov chains -- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases -- On optimizing multiplications of sparse matrices -- Continuous relaxations for Constrained Maximum-Entropy Sampling -- A submodular optimization problem with side constraints -- Convexity and Steinitz's exchange property -- On ideal clutters, metrics and multiflows -- A supermodular relaxation for scheduling with release dates -- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds -- Implementation of a linear time algorithm for certain generalized traveling salesman problems -- On dependent randomized rounding algorithms -- Coloring bipartite hypergraphs -- Improved randomized approximation algorithms for lot-sizing problems -- Minimizing total completion time in a two-machine flowshop: Analysis of special cases -- A new approach to computing optimal schedules for the job-shop scheduling problem -- Optimal on-line algorithms for single-machine scheduling -- The strongest facets of the acyclic subgraph polytope are unknown -- Transitive packing -- A polyhedral approach to the feedback vertex set problem -- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time -- Separating maximally violated comb inequalities in planar graphs -- The travelling salesman and the PQ-tree.This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.Lecture Notes in Computer Science,0302-9743 ;1084ComputersProbabilitiesSoftware engineeringAlgorithmsCalculus of variationsCombinatoricsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Probability Theory and Stochastic Processeshttps://scigraph.springernature.com/ontologies/product-market-codes/M27004Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Calculus of Variations and Optimal Control; Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26016Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computers.Probabilities.Software engineering.Algorithms.Calculus of variations.Combinatorics.Theory of Computation.Probability Theory and Stochastic Processes.Software Engineering/Programming and Operating Systems.Algorithm Analysis and Problem Complexity.Calculus of Variations and Optimal Control; Optimization.Combinatorics.519.7/7Cunningham William Hedthttp://id.loc.gov/vocabulary/relators/edtMcCormick S. Thomasedthttp://id.loc.gov/vocabulary/relators/edtQueyranne Mauriceedthttp://id.loc.gov/vocabulary/relators/edtConference on Integer Programming and Combinatorial Optimization(5th :1996 :Vancouver, B.C.)BOOK996465616503316Integer Programming and Combinatorial Optimization772247UNISA01559oam 2200493z 450 991014427770332120231106210327.03-527-61940-2(CKB)1000000000376637(SSID)ssj0000354847(PQKBManifestationID)11233484(PQKBTitleCode)TC0000354847(PQKBWorkID)10315937(PQKB)10935413(EXLCZ)99100000000037663720160829d2004 uy 0engtxtccrTransition metals for organic synthesis : building blocks and fine chemicals /Matthias Beller, Carsten BolmSecond and expanded edition[Place of publication not identified]Wiley-VCH20041 online resource (2 volumes)Bibliographic Level Mode of Issuance: Monograph3-527-30613-7 Organic compoundsSynthesisTransition metal compoundsOrganic ChemistryHILCCChemistryHILCCPhysical Sciences & MathematicsHILCCOrganic compoundsSynthesis.Transition metal compounds.Organic ChemistryChemistryPhysical Sciences & Mathematics547/.2Bolm CarstenBeller MatthiasPQKBBOOK9910144277703321Transition metals for organic synthesis877963UNINA