LEADER 02427nam0 22005293i 450 001 VAN0265060 005 20231221083744.615 017 70$2N$a9783642978814 100 $a20231019d1988 |0itac50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aGeometric Algorithms and Combinatorial Optimization$fMartin Grötschel, László Lovász, Alexander Schrijver 210 $aBerlin$cSpringer$d1988 215 $axii, 362 p.$cill.$d24 cm 410 1$1001VAN0048656$12001 $aAlgorithms and combinatorics$1210 $aBerlin [etc.]$cSpringer$v2 606 $a05-XX$xCombinatorics [MSC 2020]$3VANC019812$2MF 606 $a68Q25$xAnalysis of algorithms and problem complexity [MSC 2020]$3VANC019860$2MF 606 $a90Cxx$xMathematical programming [MSC 2020]$3VANC020086$2MF 606 $a05B35$xCombinatorial aspects of matroids and geometric lattices [MSC 2020]$3VANC021180$2MF 606 $a05C85$xGraph algorithms (graph-theoretic aspects) [MSC 2020]$3VANC023679$2MF 606 $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF 606 $a52B55$xComputational aspects related to convexity [MSC 2020]$3VANC037684$2MF 610 $aBase reduction for grids$9KW:K 610 $aBasis reduction in lattices$9KW:K 610 $aCombinatorial optimization$9KW:K 610 $aCombinatorics$9KW:K 610 $aConvexity$9KW:K 610 $aEllipsoid Method$9KW:K 610 $aGraph theory$9KW:K 610 $aLattices$9KW:K 610 $aLinear programming$9KW:K 610 $aMatching$9KW:K 610 $aProgramming$9KW:K 620 $dBerlin$3VANL000066 700 1$aGrötschel$bMartin$3VANV217107$042045 701 1$aLovasz$bLaszlo$3VANV038578$041000 701 1$aSchrijver$bAlexander$3VANV218523$0351376 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttps://doi.org/10.1007/978-3-642-97881-4$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 $aVAN0265060 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 6968 $e08eMF6968 20231023 996 $aGeometric algorithms and combinatorial optimization$978912 997 $aUNICAMPANIA