LEADER 04298nam  22007935  450 
001 9910484803003321
005 20230221041555.0
010   $a1-280-85348-4
010   $a9786610853489
010   $a3-540-71615-7
024 7 $a10.1007/978-3-540-71615-0
035   $a(CKB)1000000000284093
035   $a(EBL)3036616
035   $a(SSID)ssj0000151529
035   $a(PQKBManifestationID)11151048
035   $a(PQKBTitleCode)TC0000151529
035   $a(PQKBWorkID)10318390
035   $a(PQKB)10395444
035   $a(DE-He213)978-3-540-71615-0
035   $a(MiAaPQ)EBC3036616
035   $a(MiAaPQ)EBC6705737
035   $a(Au-PeEL)EBL6705737
035   $a(PPN)123161452
035   $a(EXLCZ)991000000000284093
100   $a20100301d2007      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aEvolutionary Computation in Combinatorial Optimization $e7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings /$fedited by Carlos Cotta, Jano van Hemert
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (250 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4446
300   $aDescription based upon print version of record.
311   $a3-540-71614-9 
320   $aIncludes bibliographical references and index.
327   $aA New Local Search Algorithm for the DNA Fragment Assembly Problem -- A Hybrid Immune-Based System for the Protein Folding Problem -- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem -- Genetic Algorithms for Word Problems in Partially Commutative Groups -- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling -- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges -- Iterated k-Opt Local Search for the Maximum Clique Problem -- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem -- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks -- A New Metaheuristic for the Vehicle Routing Problem with Split Demands -- Generation of Tree Decompositions by Iterated Local Search -- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem -- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms -- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem -- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem -- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling -- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics -- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem -- A Hybrid Method for Solving Large-Scale Supply Chain Problems -- Crossover Operators for the Car Sequencing Problem.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4446
606   $aComputer science
606   $aAlgorithms
606   $aNumerical analysis
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aTheory of Computation
606   $aAlgorithms
606   $aNumerical Analysis
606   $aDiscrete Mathematics in Computer Science
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aNumerical analysis.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615 14$aTheory of Computation.
615 24$aAlgorithms.
615 24$aNumerical Analysis.
615 24$aDiscrete Mathematics in Computer Science.
676   $a006.3823
702   $aCotta$b Carlos
702   $aVan Hemert$b Jano
712 12$aEvoCOP (Conference)
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484803003321
996   $aEvolutionary Computation in Combinatorial Optimization$92824693
997   $aUNINA