000 04096nam a22006615i 4500
001 978-3-540-75514-2
003 DE-He213
005 20240730184155.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540755142
_9978-3-540-75514-2
024 7 _a10.1007/978-3-540-75514-2
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aHybrid Metaheuristics
_h[electronic resource] :
_b4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings /
_cedited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aX, 201 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4771
505 0 _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.
650 0 _aArtificial intelligence.
_93407
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 0 _aNumerical analysis.
_94603
650 0 _aPattern recognition systems.
_93953
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_9134748
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aAutomated Pattern Recognition.
_931568
700 1 _aBartz-Beielstein, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134749
700 1 _aBlesa, Maria J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134750
700 1 _aBlum, Christian.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134751
700 1 _aNaujoks, Boris.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134752
700 1 _aRoli, Andrea.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134753
700 1 _aRudolph, Günther.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134754
700 1 _aSampels, Michael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134755
710 2 _aSpringerLink (Online service)
_9134756
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540755135
776 0 8 _iPrinted edition:
_z9783540844754
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4771
_9134757
856 4 0 _uhttps://doi.org/10.1007/978-3-540-75514-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92221
_d92221