000 04176nam a22005775i 4500
001 978-3-540-33179-7
003 DE-He213
005 20240730184550.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540331797
_9978-3-540-33179-7
024 7 _a10.1007/11730095
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings /
_cedited by Jens Gottlieb, Günther R. Raidl.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXII, 296 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 ;
_v3906
505 0 _aHybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem -- The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling -- Evolving the Structure of the Particle Swarm Optimization Algorithms -- A Tabu Search Algorithm for Optimization of Gas Distribution Networks -- Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm -- Parametrized GRASP Heuristics for Three-Index Assignment -- A Memetic Algorithm with Bucket Elimination for the Still Life Problem -- Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA -- Particle Swarm for the Traveling Salesman Problem -- Hierarchical Cellular Genetic Algorithm -- Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation -- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach -- A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems -- New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm -- Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems -- A Memetic Algorithm with Population Management (MA/PM) for the Capacitated Location-Routing Problem -- The Core Concept for the Multidimensional Knapsack Problem -- Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines -- A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem -- A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems -- Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning -- A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems -- An Efficient Hybrid Search Algorithm for Various Optimization Problems -- A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament.
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aNumerical analysis.
_94603
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aTheory of Computation.
_9135914
650 2 4 _aAlgorithms.
_93390
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aGottlieb, Jens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135915
700 1 _aRaidl, Günther R.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135916
710 2 _aSpringerLink (Online service)
_9135917
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540331780
776 0 8 _iPrinted edition:
_z9783540822127
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3906
_9135918
856 4 0 _uhttps://doi.org/10.1007/11730095
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92375
_d92375