000 04066nam a22005415i 4500
001 978-3-642-12139-5
003 DE-He213
005 20160624102141.0
007 cr nn 008mamaa
008 100402s2010 gw | s |||| 0|eng d
020 _a9783642121395
_9978-3-642-12139-5
024 7 _a10.1007/978-3-642-12139-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010. Proceedings /
_cedited by Peter Cowling, Peter Merz.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXII, 290p. 67 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6022
505 0 _aDual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- A Genetic Algorithm to Minimize Chromatic Entropy -- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings -- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks -- Ant Colony Optimization for Tree Decompositions -- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times -- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures -- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems -- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations -- A Study of Memetic Search with Multi-parent Combination for UBQP -- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing -- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres -- Geometric Generalization of the Nelder-Mead Algorithm -- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows -- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles -- Multilevel Variable Neighborhood Search for Periodic Routing Problems -- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive -- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem -- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem -- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer vision.
650 0 _aOptical pattern recognition.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aPattern Recognition.
650 2 4 _aImage Processing and Computer Vision.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aCowling, Peter.
_eeditor.
700 1 _aMerz, Peter.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642121388
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6022
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-12139-5
942 _2EBK8973
_cEBK
999 _c38267
_d38267