000 03967nam a22005775i 4500
001 978-3-540-71615-0
003 DE-He213
005 20240730191927.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540716150
_9978-3-540-71615-0
024 7 _a10.1007/978-3-540-71615-0
_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] :
_b7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings /
_cedited by Carlos Cotta, Jano van Hemert.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 244 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 ;
_v4446
505 0 _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.
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.
_9147885
650 2 4 _aAlgorithms.
_93390
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aCotta, Carlos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9147886
700 1 _avan Hemert, Jano.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9147887
710 2 _aSpringerLink (Online service)
_9147888
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540716143
776 0 8 _iPrinted edition:
_z9783540836872
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4446
_9147889
856 4 0 _uhttps://doi.org/10.1007/978-3-540-71615-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93980
_d93980