LEADER 01038nam0-2200361---450 001 990009891890403321 005 20180509112546.0 010 $a978-88-17-05685-4 035 $a000989189 035 $aFED01000989189 035 $a(Aleph)000989189FED01 035 $a000989189 100 $a20140829d2012----km-y0itay50------ba 101 1 $aita$ceng 102 $aIT 105 $aa-------001yy 200 1 $aPartire leggeri$eil metodo Lean Startup : innovazione senza sprechi per nuovi business di successo$fEric Ries 210 $aMilano$cRizzoli ETAS$d2012 215 $aXX, 321 p.$ctab.$d22 cm 454 0$12001$a<>lean startup$916215 610 0 $aImprese$aAvvio$aSec. 21. 610 0 $aLean Startup$aStoria 676 $a658.11$v22$zita 700 1$aRies,$bEric$0438192 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990009891890403321 952 $a658.11 RIE 1$b6794$fBFS 952 $a1-6-588-TI$fECA 959 $aBFS 959 $aECA 996 $aLean startup$916215 997 $aUNINA LEADER 03091nam 2200589Ia 450 001 996218625803316 005 20230617035310.0 010 $a1-281-32215-6 010 $a9786611322151 010 $a0-470-70895-6 010 $a0-470-75102-9 010 $a0-470-75037-5 035 $a(CKB)1000000000400931 035 $a(EBL)351043 035 $a(OCoLC)437214042 035 $a(SSID)ssj0000132877 035 $a(PQKBManifestationID)11136340 035 $a(PQKBTitleCode)TC0000132877 035 $a(PQKBWorkID)10041279 035 $a(PQKB)11278833 035 $a(MiAaPQ)EBC351043 035 $a(EXLCZ)991000000000400931 100 $a20030103d2004 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aCrop post-harvest$b[electronic resource] $escience and technology$hVolume 2$iDurables /$fedited by Rick Hodges and Graham Farrell 210 $aOxford, UK ;$aMalden, MA $cBlackwell Science$d2004 215 $a1 online resource (297 p.) 300 $aDescription based upon print version of record. 311 $a0-632-05724-6 320 $aIncludes bibliographical references and index. 327 $aCrop Post-Harvest: Science and Technology; Contents; Contributors; Preface; Acknowledgements; 1 Rice; China; Japan; Australia; 2 Maize; Tanzania (East and Central Africa); Zimbabwe; Argentina; 3 Wheat; Pakistan and Afghanistan; United Kingdom; United States of America; Australia; 4 Malting Barley: Europe; 5 Sorghum; Underground storage; South India; Ethiopia; 6 Common Beans: Latin America; 7 Cowpea: United States of America; 8 Miscellaneous Oilseeds; Worldwide Oilseeds; Canola (rapeseed): Canada; 9 Peanuts; Senegal; United States of America; 10 Copra: The Philippines; 11 Coffee 327 $a12 Cocoa: West Africa (Ghana)13 Dried Fruit and Nuts:United States of America; 14 Cured Fish; Senegal; Beetle infestation and control in the developing tropics; Index; Colour Plates 330 $aDurable commodities are the raw products from which food can be made and are the staples on which most humans rely; with but a few exceptions they are the seeds of plants. Volume 1 of this ground-breaking book series (details below) explains how crops should be dried, handled, protected from pests and stored by smaller holders or large-scale enterprises. This second volume presents a series of case studies on how durable crops are actually stored and marketed. The compilation of this three-volume work has been supported and is endorsed by the Natural Resources Institute of the Universit 606 $aCrops$xPostharvest technology 606 $aAgricultural processing 615 0$aCrops$xPostharvest technology. 615 0$aAgricultural processing. 676 $a631.56 701 $aGolob$b P$0941278 701 $aFarrell$b Graham$cDr.$0939632 701 $aHodges$b Rick$cDr.$0941279 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996218625803316 996 $aCrop post-harvest$92123131 997 $aUNISA LEADER 02098nam0 22004333i 450 001 VAN0248518 005 20230529094056.940 017 70$2N$a9783658291495 100 $a20220725d2020 |0itac50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aˆA ‰Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization$fStefan Rocktäschel 210 $aWiesbaden$cSpringer Spektrum$d2020 215 $aviii, 70 p.$cill.$d24 cm 410 1$1001VAN0113924$12001 $aBestMasters$1210 $aBerlin [etc.]$cSpringer 500 1$3VAN0248519$aˆA ‰Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization$92983597 606 $a90C25$xConvex programming [MSC 2020]$3VANC019709$2MF 606 $a65K05$xNumerical mathematical programming methods [MSC 2020]$3VANC028868$2MF 606 $a90C57$xPolyhedral combinatorics, branch-and-bound, branch-and-cut [MSC 2020]$3VANC031076$2MF 606 $a90C11$xMixed integer programming [MSC 2020]$3VANC033694$2MF 606 $a90C29$xMulti-objective and goal programming [MSC 2020]$3VANC033695$2MF 610 $aAlgorithm$9KW:K 610 $aBranch and bound$9KW:K 610 $aConvex$9KW:K 610 $aMixed integer programming$9KW:K 610 $aMultiobjective programming$9KW:K 610 $aNonlinear optimization$9KW:K 620 $aDE$dWiesbaden$3VANL000457 700 1$aRocktäschel$bStefan$3VANV203444$0963845 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-658-29149-5$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0248518 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 4508 $e08eMF4508 20220725 996 $aBranch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization$92983597 997 $aUNICAMPANIA