LEADER 02570nam0 22005773i 450 001 VAN00275284 005 20240806101542.229 017 70$2N$a9783030784010 100 $a20240422d2021 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aSeparable Optimization$eTheory and Methods$fStefan M. Stefanov 205 $a2. ed 210 $aCham$cSpringer$d2021 215 $axvii, 356 p.$cill.$d24 cm 410 1$1001VAN00067197$12001 $aSpringer optimization and its applications$1210 $aBerlin [etc.]$cSpringer$d2006-$v177 606 $a52A41$xConvex functions and convex programs in convex geometry [MSC 2020]$3VANC020312$2MF 606 $a52B12$xSpecial polytopes (linear programming, centrally symmetric, etc.) [MSC 2020]$3VANC037795$2MF 606 $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF 606 $a90C25$xConvex programming [MSC 2020]$3VANC019709$2MF 606 $a90C30$xNonlinear programming [MSC 2020]$3VANC023183$2MF 606 $a90C39$xDynamic programming [MSC 2020]$3VANC033782$2MF 606 $a90C59$xApproximation methods and heuristics in mathematical programming [MSC 2020]$3VANC034026$2MF 610 $aAlgorithms$9KW:K 610 $aApproximation$9KW:K 610 $aBounded variables$9KW:K 610 $aChebyshev approximation$9KW:K 610 $aConvex analysis$9KW:K 610 $aConvex programming$9KW:K 610 $aDynamic Programming$9KW:K 610 $aKnapsack polytope$9KW:K 610 $aKnapsack problem$9KW:K 610 $aLinear optimization$9KW:K 610 $aMathematical programming$9KW:K 610 $aNonlinear transportation problem$9KW:K 610 $aOperations Research$9KW:K 610 $aSaddle points Lagrangian$9KW:K 610 $aSeparable optimization$9KW:K 610 $aSeparable programming$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aStefanov$bStefan M.$3VANV227768$01075254 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20241115$gRICA 856 4 $uhttps://doi.org/10.1007/978-3-030-78401-0$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 $aVAN00275284 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-book 8402 $e08eMF8402 20240503 996 $aSeparable Optimization$92584241 997 $aUNICAMPANIA