LEADER 02495nam0 22005533i 450 001 VAN00278439 005 20250922121806.137 017 70$2N$a9789811959165 100 $a20240624d2022 |0itac50 ba 101 $aeng 102 $aSG 105 $a|||| ||||| 200 1 $aIntelligent Algorithms for Packing and Cutting Problem$fYunqing Rao, Qiang Luo 210 $aSingapore$cSpringer$d2022 215 $ax, 330 p.$cill.$d24 cm 410 1$1001VAN00247952$12001 $aEngineering Applications of Computational Methods$1210 $aSingapore$cSpringer$d2020-$v10 606 $a68-XX$xComputer science [MSC 2020]$3VANC019670$2MF 606 $a68T20$xProblem solving in the context of artificial intelligence (heuristics, search strategies, etc.) [MSC 2020]$3VANC026578$2MF 606 $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF 606 $a90C59$xApproximation methods and heuristics in mathematical programming [MSC 2020]$3VANC034026$2MF 610 $aBeam search$9KW:K 610 $aCutting problem$9KW:K 610 $aEngineering Applications$9KW:K 610 $aGenetic Algorithms$9KW:K 610 $aGrey wolf optimization$9KW:K 610 $aIntegrated system$9KW:K 610 $aIntelligent method$9KW:K 610 $aIrregular strip packing$9KW:K 610 $aKnapsack packing problem$9KW:K 610 $aPacking problem$9KW:K 610 $aPacking problem with defects$9KW:K 610 $aParallel machine scheduling$9KW:K 610 $aParticle Swarm Optimization$9KW:K 610 $aRectangular strip packing$9KW:K 610 $aReinforcement Learning$9KW:K 610 $aTabu search$9KW:K 610 $aVariable neighborhood search$9KW:K 620 $aSG$dSingapore$3VANL000061 700 1$aRao$bYunqing$3VANV230988$01261568 701 1$aLuo$bQiang$3VANV230989$01741831 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20250926$gRICA 856 4 $uhttps://doi.org/10.1007/978-981-19-5916-5$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 $aVAN00278439 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-Book 9004 $e08eMF9004 20240701 996 $aIntelligent Algorithms for Packing and Cutting Problem$94168157 997 $aUNICAMPANIA