LEADER 01217nam2-2200397---450- 001 990002677000203316 005 20090714124509.0 010 $a88-14-11875-2 035 $a000267700 035 $aUSA01000267700 035 $a(ALEPH)000267700USA01 035 $a000267700 100 $a20051024d2005----km-y0itay0103----ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aFondamenti del diritto privato europeo$fGuido Alpa, Mads Andenas 210 $aMilano$cGiuffrè$dcopyr. 2005 215 $aXXI, 813 p.$d22 cm 461 1$10010005415$12001$aTrattato di diritto privato 606 0 $aDiritto privato$yEuropa 676 $a346.4 700 1$aALPA,$bGuido$08875 701 1$aANDENAS,$bMads$0278955 801 0$aIT$bsalbc$gISBD 912 $a990002677000203316 951 $aXXV.1.B 292/16 (IG I 1081/16)$b47893 G.$cXXV.1.B 292/16 (IG I 1081)$d00118199 951 $aTRA B VI 14$b6079 DIRCE 959 $aBK 969 $aGIU 969 $aDIRCE 979 $aMARIASEN$b90$c20051024$lUSA01$h1836 979 $aDIRCE$b90$c20071019$lUSA01$h0943 979 $aRSIAV5$b90$c20090714$lUSA01$h1245 996 $aFondamenti del diritto privato europeo$9742075 997 $aUNISA LEADER 02246nam0 2200529 i 450 001 VAN00124464 005 20240806100816.456 017 70$2N$a9783662560396 100 $a20191018d2018 |0itac50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aCombinatorial Optimization$eTheory and Algorithms$fBernhard Korte, Jens Vygen 205 $a6. ed 210 $aBerlin$cSpringer$d2018 215 $axxi, 698 p.$cill.$d24 cm 410 1$1001VAN00048656$12001 $aAlgorithms and combinatorics$1210 $aBerlin [etc.]$cSpringer$v21 500 1$3VAN00236166$aCombinatorial Optimization$982153 606 $a05C85$xGraph algorithms (graph-theoretic aspects) [MSC 2020]$3VANC023679$2MF 606 $a68Q25$xAnalysis of algorithms and problem complexity [MSC 2020]$3VANC019860$2MF 606 $a68R10$xGraph theory (including graph drawing) in computer science [MSC 2020]$3VANC023623$2MF 606 $a90C27$xCombinatorial optimization [MSC 2020]$3VANC031074$2MF 610 $aApproximation algorithms$9KW:K 610 $aCombinatorial optimization$9KW:K 610 $aCombinatorics$9KW:K 610 $aDiscrete algorithms$9KW:K 610 $aFacility location$9KW:K 610 $aGraphs$9KW:K 610 $aInteger linear programming$9KW:K 610 $aMatching$9KW:K 610 $aMathematical programming$9KW:K 610 $aMatroids$9KW:K 610 $aNetwork design$9KW:K 610 $aNetwork flows$9KW:K 610 $aTraveling salesman problem$9KW:K 620 $dBerlin$3VANL000066 700 1$aKorte$bBernhard$3VANV038577$0441956 701 1$aVygen$bJens$3VANV078709$0441957 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240906$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-662-56039-6$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 $aVAN00124464 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 1069 $e08eMF1069 20191018 996 $aCombinatorial optimization$982153 997 $aUNICAMPANIA