000 | 04131nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-31996-2 | ||
003 | DE-He213 | ||
005 | 20240730195641.0 | ||
007 | cr nn 008mamaa | ||
008 | 100402s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540319962 _9978-3-540-31996-2 |
||
024 | 7 |
_a10.1007/b107115 _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] : _b5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings / _cedited by Günther R. Raidl, Jens Gottlieb. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aXI, 271 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 ; _v3448 |
|
505 | 0 | _aAn External Partial Permutations Memory for Ant Colony Optimization -- A Novel Application of Evolutionary Computing in Process Systems Engineering -- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework -- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem -- EvoGeneS, a New Evolutionary Approach to Graph Generation -- On the Application of Evolutionary Algorithms to the Consensus Tree Problem -- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem -- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem -- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm - MOMGA-IIa -- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions -- Estimation of Distribution Algorithms with Mutation -- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution -- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring -- Application of the Grouping Genetic Algorithm to University Course Timetabling -- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems -- Population Training Heuristics -- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem -- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem -- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator -- Ant Algorithm for the Graph Matching Problem -- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem -- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem -- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem -- An AgentModel for Binary Constraint Satisfaction Problems. | |
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. _9160953 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
700 | 1 |
_aRaidl, Günther R. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160954 |
|
700 | 1 |
_aGottlieb, Jens. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160955 |
|
710 | 2 |
_aSpringerLink (Online service) _9160956 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540253372 |
776 | 0 | 8 |
_iPrinted edition: _z9783540809142 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3448 _9160957 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b107115 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c95725 _d95725 |