02333oam 2200673I 450 991045591600332120200520144314.01-138-43286-51-135-82952-71-280-10975-097866101097530-203-47390-610.4324/9780203473900 (CKB)111087027088022(EBL)181036(OCoLC)437084229(SSID)ssj0000172844(PQKBManifestationID)11176865(PQKBTitleCode)TC0000172844(PQKBWorkID)10160872(PQKB)10213609(MiAaPQ)EBC181036(Au-PeEL)EBL181036(CaPaEBR)ebr10061040(CaONFJC)MIL10975(OCoLC)52634855(EXLCZ)9911108702708802220180706d1993 uy 0engur|n|---|||||txtccrHomes and health how housing and health interact /Bernard Ineichen1st ed.London ;New York, N.Y. :E & FN Spon,1993.1 online resource (122 p.)Description based upon print version of record.0-203-23954-7 0-419-17100-2 Includes bibliographical references (p. [99]-106) and index.Book Cover; Title; Contents; Acknowledgements; The legacy of the past; Current concerns; Living on the margins; Conclusions; References and further reading; IndexThis book links where people live with their health. The author reviews how housing has influenced health throughout the past hundred and fifty years, discusses in detail current issues concerning housing and health and describes attempts at housing particular groups whose health is at risk.Housing and healthEnvironmental healthElectronic books.Housing and health.Environmental health.362.1/9698363.5363.50941Ineichen Bernard.941007MiAaPQMiAaPQMiAaPQBOOK9910455916003321Homes and health2122166UNINA04448oam 2200637 450 99646528860331620210723010750.01-280-80488-297866108048873-540-48777-810.1007/3-540-48777-8(CKB)1000000000211173(EBL)3036556(SSID)ssj0000299863(PQKBManifestationID)11223538(PQKBTitleCode)TC0000299863(PQKBWorkID)10242825(PQKB)11663751(DE-He213)978-3-540-48777-7(MiAaPQ)EBC3036556(MiAaPQ)EBC6489726(PPN)155187503(EXLCZ)99100000000021117320210723d1999 uy 0engur|n|---|||||txtccrInteger programming and combinatorial optimization 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings /edited by Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger1st ed. 1999.Berlin, Germany ;New York, New York :Springer,[1999]©19991 online resource (462 p.)Lecture Notes in Computer Science,0302-9743 ;1610Description based upon print version of record.3-540-66019-4 Includes bibliographical references and index.Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances -- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts -- Solving the Convex Cost Integer Dual Network Flow Problem -- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem -- Valid Inequalities for Problems with Additive Variable Upper Bounds -- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version) -- On the Separation of Maximally Violated mod-k Cuts -- Improved Approximation Algorithms for Capacitated Facility Location Problems -- Optimal 3-Terminal Cuts and Linear Programming -- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem -- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube -- Universally Maximum Flow with Piecewise-Constant Capacities -- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope -- An Orientation Theorem with Parity Conditions -- Parity Constrained k-Edge-Connected Orientations -- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs -- On the Chvátal Rank of Certain Inequalities -- The Square-Free 2-Factor Problem in Bipartite Graphs -- The m-Cost ATSP -- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem -- Edge-Splitting Problems with Demands -- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors -- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract) -- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms -- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow -- Approximation Algorithms for a Directed Network Design Problem -- Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract) -- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts -- Scheduling Two Machines with Release Times -- An Introduction to Empty Lattice Simplices -- On Optimal Ear-Decompositions of Graphs -- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract) -- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.Lecture Notes in Computer Science,0302-9743 ;1610Integer programmingCongressesCombinatorial optimizationCongressesInteger programmingCombinatorial optimization519.77Woeginger GerhardCornuejols Gerard1950-Burkard Rainer E.Conference on Integer Programming and Combinatorial Optimization(7th :1999 :Graz, Austria)MiAaPQMiAaPQUtOrBLWBOOK996465288603316Integer Programming and Combinatorial Optimization772247UNISA