LEADER 03108nam  2200577 a 450 
001 9910483139203321
005 20200520144314.0
010   $a1-280-38941-9
010   $a9786613567338
010   $a3-642-16053-0
024 7 $a10.1007/978-3-642-16054-7
035   $a(CKB)2650000000000171
035   $a(SSID)ssj0000446527
035   $a(PQKBManifestationID)11285490
035   $a(PQKBTitleCode)TC0000446527
035   $a(PQKBWorkID)10496169
035   $a(PQKB)10309119
035   $a(DE-He213)978-3-642-16054-7
035   $a(MiAaPQ)EBC3065927
035   $a(PPN)149029853
035   $a(EXLCZ)992650000000000171
100   $a20100816d2010      uy         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHybrid metaheuristics $e7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010 : proceedings /$fMaria J. Blesa ... [et al.], (eds.)
205   $a1st ed.
210   $aBerlin $cSpringer$d2010
215   $a1 online resource (X, 223 p. 43 illus.)
225 1 $aLecture notes in computer science,$x0302-9743 ;$v6373
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-16054-9 
320   $aIncludes bibliographical references and index.
327   $aA Hybrid Metaheuristic for the Longest Common Subsequence Problem -- Hybrid Algorithms for the Variable Sized Bin Packing Problem -- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model -- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem -- A New Approach for Solving the Generalized Traveling Salesman Problem -- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem -- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem -- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents -- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem -- An Improved Memetic Algorithm for Break Scheduling -- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem -- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem -- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem -- SearchCol: Metaheuristic Search by Column Generation -- Survey: Matheuristics for Rich Vehicle Routing Problems.
410  0$aLecture notes in computer science ;$v6373.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
606   $aHeuristic programming$vCongresses
615  0$aHeuristic programming
676   $a006.3
701   $aBlesa$b Maria J$01753724
712 12$aHM 2010
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483139203321
996   $aHybrid metaheuristics$94189705
997   $aUNINA