01053nam--2200349---450-99000365911020331620120508132340.0978-88-634-2186-6000365911USA01000365911(ALEPH)000365911USA0100036591120120508d2011----km-y0itay50------baitaITy|||||||001yy<<Il>> diritto tra forma e formalismoa cura di Luisa AvitabileNapoliEditoriale scientifica2011XXII, 262 p.24 cmAtti della Giornata di studi tenuta a Cassino nel 2010Filosofia del dirittoBNCF340.122AVITABILE,LuisaITsalbcISBD990003659110203316XXII.1.C. 94172457 G.XXII.1.C.00310436BKGIUCHIARA9020120508USA011322CHIARA9020120508USA011323Diritto tra forma e formalismo1139040UNISA03083nam 22005055 450 99646582740331620200706044351.03-540-47755-110.1007/BFb0000035(CKB)1000000000230649(SSID)ssj0000322274(PQKBManifestationID)11233023(PQKBTitleCode)TC0000322274(PQKBWorkID)10287567(PQKB)11310558(DE-He213)978-3-540-47755-6(PPN)155198157(EXLCZ)99100000000023064920121227d1987 u| 0engurnn|008mamaatxtccrConstrained Global Optimization: Algorithms and Applications[electronic resource] /by Panos M. Pardalos, J. Ben Rosen1st ed. 1987.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1987.1 online resource (IX, 143 p.) Lecture Notes in Computer Science,0302-9743 ;268Bibliographic Level Mode of Issuance: Monograph3-540-18095-8 Convex sets and functions -- Optimality conditions in nonlinear programming -- Combinatorial optimization problems that can be formulated as nonconvex quadratic problems -- Enumerative methods in nonconvex programming -- Cutting plane methods -- Branch and bound methods -- Bilinear programming methods for nonconvex quadratic problems -- Large scale problems -- Global minimization of indefinite quadratic problems -- Test problems for global nonconvex quadratic programming algorithms.Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. Such problems are widespread in mathematical modeling of real world systems for a very broad range of applications. The applications include economies of scale, fixed charges, allocation and location problems, quadratic assignment and a number of other combinatorial optimization problems. More recently it has been shown that certain aspects of VLSI chip design and database problems can be formulated as constrained global optimization problems with a quadratic objective function. Although standard nonlinear programming algorithms will usually obtain a local minimum to the problem , such a local minimum will only be global when certain conditions are satisfied (such as f and K being convex).Lecture Notes in Computer Science,0302-9743 ;268Numerical analysisNumerical Analysishttps://scigraph.springernature.com/ontologies/product-market-codes/M14050Numerical analysis.Numerical Analysis.518Pardalos Panos Mauthttp://id.loc.gov/vocabulary/relators/aut318341Rosen J. Benauthttp://id.loc.gov/vocabulary/relators/autBOOK996465827403316Constrained global optimization384503UNISA01171nam0 22002773i 450 VAN010481620230721094724.99220160209d1966 |0itac50 baitaIT|||| |||||ˆLe ‰definizioni dei giuristi romaniRemo MartiniMilanoGiuffrè1966XII, 426 p.26 cm001VAN01009212001 Pubblicazioni della Facoltà di giurisprudenza, Università di Milano. Ser. 2. Studi di diritto romano210 MilanoGiuffré.3Definizioni giuridicheDiritto romanoVANC031791SGMilanoVANL000284340.54Diritto romano21MartiniRemoVANV001814228898Giuffrè <editore>VANV109181650ITSOL20230728RICABIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZAIT-CE0105VAN00VAN0104816BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA00CONS BL.900M.525 00BL 3524 SLP 20160209 Biblioteca LauriaDefinizioni dei giuristi romani646079UNICAMPANIA