01567nam a2200337 i 450099100385476970753620030103125001.0020808s1989 it 00| 0 ita d8822107489b11874302-39ule_instPRUMB66528ExLDip.to SSSCita362.709454Emiliani, Francesca170651Il bambino nella mente e nelle parole delle madri :gli indicatori soggettivi della qualità della vita infantile /a cura di Francesca Emiliani, Maura Gelati, Luisa MolinariFirenze :La nuova Italia,1989VI, 175 p. ;21 cmDidattica viva ;149BambiniCondizioni socialiEmilia RomagnaFanciulliCondizioni socialiEmilia-RomagnaGelati, MauraMolinari, Luisa.b1187430228-04-1707-01-03991003854769707536LE024 PS EV I 15V. 212021000199707le021ex DUSS-E0.00-l- 01010.i1162660401-07-02LE022 362 EMI01.0112022000010207le022-E0.00-l- 02020.i1107080828-06-02LE022 MP 69 E 4622022000055215le022-E0.00-l- 01010.i1397492023-12-04LE021 DI3A561LE021N-7641le021-E0.00-l- 00000.i1212851x07-01-03Bambino nella mente e nelle parole delle madri900860UNISALENTO(2)le022(2)le02101-01-02ma -itait 3403608nam 22007212 450 991082198540332120151005020622.01-107-22177-31-283-11116-097866131111661-139-07652-30-511-97715-81-139-08334-11-139-07880-11-139-08107-11-139-07080-0(CKB)2670000000093843(EBL)691988(OCoLC)726734811(SSID)ssj0000523591(PQKBManifestationID)11333399(PQKBTitleCode)TC0000523591(PQKBWorkID)10542705(PQKB)11558967(UkCbUP)CR9780511977152(Au-PeEL)EBL691988(CaPaEBR)ebr10470664(CaONFJC)MIL311116(MiAaPQ)EBC691988(PPN)189906545(EXLCZ)99267000000009384320101013d2011|||| uy| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierIterative methods in combinatorial optimization /Lap Chi Lau, R. Ravi, Mohit Singh[electronic resource]Cambridge :Cambridge University Press,2011.1 online resource (xi, 242 pages) digital, PDF file(s)Cambridge texts in applied mathematics ;46Title from publisher's bibliographic system (viewed on 05 Oct 2015).0-521-18943-8 1-107-00751-8 Includes bibliographical references and index.Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.Cambridge texts in applied mathematics ;46.Iterative methods (Mathematics)Combinatorial optimizationIterative methods (Mathematics)Combinatorial optimization.518/.26COM000000bisacshLau Lap Chi1654147Ravi R(Ramamoorthi),1969-Singh MohitUkCbUPUkCbUPBOOK9910821985403321Iterative methods in combinatorial optimization4005802UNINA