001436210 000__ 02919cam\a2200529\i\4500
001436210 001__ 1436210
001436210 003__ OCoLC
001436210 005__ 20230309004015.0
001436210 006__ m\\\\\o\\d\\\\\\\\
001436210 007__ cr\un\nnnunnun
001436210 008__ 210501s2021\\\\sz\\\\\\ob\\\\001\0\eng\d
001436210 020__ $$a9783030702779$$q(electronic bk.)
001436210 020__ $$a3030702774$$q(electronic bk.)
001436210 020__ $$z3030702766
001436210 020__ $$z9783030702762
001436210 0247_ $$a10.1007/978-3-030-70277-9$$2doi
001436210 035__ $$aSP(OCoLC)1249091063
001436210 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCO$$dEBLCP$$dOCLCF$$dN$T$$dBRX$$dUKAHL$$dOCLCQ$$dOCLCO$$dCOM$$dOCLCQ
001436210 049__ $$aISEA
001436210 050_4 $$aQA76.9.A43
001436210 08204 $$a005.1$$223
001436210 1001_ $$aManiezzo, Vittorio,$$eauthor.
001436210 24510 $$aMatheuristics :$$balgorithms and implementations /$$cVittorio Maniezzo, Marco Antonio Boschetti, Thomas Stützle.
001436210 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2021]
001436210 300__ $$a1 online resource
001436210 336__ $$atext$$btxt$$2rdacontent
001436210 337__ $$acomputer$$bc$$2rdamedia
001436210 338__ $$aonline resource$$bcr$$2rdacarrier
001436210 4901_ $$aEURO advanced tutorials on operational research,$$x2364-687X
001436210 504__ $$aIncludes bibliographical references and index.
001436210 5050_ $$aPart I: Contextual Issues -- 1. The Generalized Assignment Problem -- 2. Automatic Design for Matheuristics -- Part II: Metaheuristic Hybrids -- 3. Single Solution Metaheuristics -- 4. Population-Based metaheuristics -- Part III: Original Matheuristics -- 5. Diving Heuristics -- 6. Very Large-Scale Neighborhood Search -- 7. Decomposition Based Heuristics -- 8. Corridor Method -- 9. Kernel Search -- 10. Fore-and-Back.
001436210 506__ $$aAccess limited to authorized users.
001436210 520__ $$aThis book is the first comprehensive tutorial on matheuristics. Matheuristics are based on mathematical extensions of previously known heuristics, mainly metaheuristics, and on original, area-specific approaches. This tutorial provides a detailed discussion of both contributions, presenting the pseudocodes of over 40 algorithms, abundant literature references, and for each case a step-by-step description of a sample run on a common Generalized Assignment Problem example. C++ source codes of all algorithms are available in an associated SW repository.
001436210 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 5, 2021).
001436210 650_0 $$aHeuristic algorithms.
001436210 650_6 $$aAlgorithmes heuristiques.
001436210 655_0 $$aElectronic books.
001436210 7001_ $$aBoschetti, Marco Antonio,$$eauthor.
001436210 7001_ $$aStützle, Thomas,$$eauthor.
001436210 77608 $$iPrint version:$$z9783030702762$$w(OCoLC)1235416151
001436210 830_0 $$aEURO advanced tutorials on operational research,$$x2364-687X
001436210 852__ $$bebk
001436210 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-70277-9$$zOnline Access$$91397441.1
001436210 909CO $$ooai:library.usi.edu:1436210$$pGLOBAL_SET
001436210 980__ $$aBIB
001436210 980__ $$aEBOOK
001436210 982__ $$aEbook
001436210 983__ $$aOnline
001436210 994__ $$a92$$bISE