LEADER 01288nam0 22003131i 450 001 VAN0010947 005 20061013120000.0 010 $a88-13-21048-5 020 $aIT$b99 5946 100 $a20021128d1998 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aAzzeramento e ricostituzione del capitale nelle S.p.a.$fCarlo Alberto Busi 210 $aPadova$cCedam$d1998 215 $aVII, 194 p.$d22 cm. 410 1$1001VAN0009424$12001 $aBiblioteca giuridica. Attualità$1210 $aPadova$cCEDAM.$v23 606 $aSocietà per azioni$xCapitale$xLegislazione$3VANC006031$2FI 620 $dPadova$3VANL000007 676 $a346.450666$cDiritto delle società. Azioni e azionisti. Italia$v21 700 1$aBusi$bCarlo A.$3VANV008303$0729753 712 $aCEDAM $3VANV111515$4650 790 1$aBusi, Carlo Alberto$zBusi, Carlo A.$3VANV065396 801 $aIT$bSOL$c20230616$gRICA 899 $aBIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$1IT-CE0105$2VAN00 912 $aVAN0010947 950 $aBIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$d00CONS VI.Eb.47 $e00 14263 20021129 996 $aAzzeramento e ricostituzione del capitale nelle S.p.a$91429866 997 $aUNICAMPANIA LEADER 02259nam0 2200445 i 450 001 VAN00124802 005 20240806100817.358 017 70$2N$a9783319775289 100 $a20191025d2018 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aMachine Scheduling to Minimize Weighted Completion Times$eThe Use of the ?-point$fNicoló Gusmeroli 210 $aCham$cSpringer$d2018 215 $axi, 53 p.$d24 cm 410 1$1001VAN00102596$12001 $aSpringerBriefs in mathematics$1210 $aBerlin [etc.]$cSpringer$d2011- 500 1$3VAN00236348$aMachine Scheduling to Minimize Weighted Completion Times$91563642 606 $a68M20$xPerformance evaluation, queueing, and scheduling in the context of computer systems [MSC 2020]$3VANC024644$2MF 606 $a68Q25$xAnalysis of algorithms and problem complexity [MSC 2020]$3VANC019860$2MF 606 $a68Wxx$xAlgorithms in computer science [MSC 2020]$3VANC021296$2MF 606 $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF 606 $a90B35$xScheduling theory, deterministic in operations research [MSC 2020]$3VANC033687$2MF 606 $a90C27$xCombinatorial optimization [MSC 2020]$3VANC031074$2MF 606 $a90C59$xApproximation methods and heuristics in mathematical programming [MSC 2020]$3VANC034026$2MF 610 $aApproximation algorithms$9KW:K 610 $aLP-relaxation$9KW:K 610 $aRelease dates$9KW:K 610 $aScheduling theory$9KW:K 610 $a?-point$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aGusmeroli$bNicoló$3VANV096229$0767836 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20241115$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-77528-9$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 $aVAN00124802 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-book 1225 $e08eMF1225 20191025 996 $aMachine Scheduling to Minimize Weighted Completion Times$91563642 997 $aUNICAMPANIA