LEADER 03078nam  2200553 a 450 
001 9910484172003321
005 20200520144314.0
010   $a3-540-75514-4
024 7 $a10.1007/978-3-540-75514-2
035   $a(CKB)1000000000490657
035   $a(SSID)ssj0000318172
035   $a(PQKBManifestationID)11212525
035   $a(PQKBTitleCode)TC0000318172
035   $a(PQKBWorkID)10307458
035   $a(PQKB)10446461
035   $a(DE-He213)978-3-540-75514-2
035   $a(MiAaPQ)EBC3068180
035   $a(PPN)123165539
035   $a(EXLCZ)991000000000490657
100   $a20070829d2007      uy         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHybrid metaheuristics $e4th international workshop, HM 2007, Dortmund, Germany, October 8-9, 2007 : proceedings /$fThomas Bartz-Beielstein ... [et al.] (eds.)
205   $a1st ed. 2007.
210   $aBerlin ;$aNew York $cSpringer$dc2007
215   $a1 online resource (X, 201 p.)
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
225 1 $aLecture notes in computer science,$x0302-9743 ;$v4771
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-75513-6 
320   $aIncludes bibliographical references and index.
327   $aEvolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
410  0$aLecture notes in computer science ;$v4771.
517 3 $aHM 2007
606   $aHeuristic programming$vCongresses
615  0$aHeuristic programming
676   $a006.3
701   $aBartz-Beielstein$b Thomas$01337543
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484172003321
996   $aHybrid metaheuristics$94187861
997   $aUNINA