|
|
|
|
LEADER |
03859nam a22005775i 4500 |
001 |
978-3-540-24652-7 |
003 |
DE-He213 |
005 |
20151204160236.0 |
007 |
cr nn 008mamaa |
008 |
121227s2004 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540246527
|9 978-3-540-24652-7
|
024 |
7 |
|
|a 10.1007/b96499
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA402.5-402.6
|
072 |
|
7 |
|a PBU
|2 bicssc
|
072 |
|
7 |
|a MAT003000
|2 bisacsh
|
082 |
0 |
4 |
|a 519.6
|2 23
|
245 |
1 |
0 |
|a Evolutionary Computation in Combinatorial Optimization
|h [electronic resource] :
|b 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings /
|c edited by Jens Gottlieb, Günther R. Raidl.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2004.
|
300 |
|
|
|a X, 240 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3004
|
505 |
0 |
|
|a EvoCOP Contributions -- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm -- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms -- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem -- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem -- AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem -- Scatter Search and Memetic Approaches to the Error Correcting Code Problem -- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem -- Parallel Ant Systems for the Capacitated Vehicle Routing Problem -- A Hierarchical Social Metaheuristic for the Max-Cut Problem -- On the Structure of Sequential Search: Beyond “No Free Lunch” -- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Study -- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems -- Binary Merge Model Representation of the Graph Colouring Problem -- Hardness Prediction for the University Course Timetabling Problem -- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem -- On the Use of Path Relinking for the ? – Hub Median Problem -- Solving a Real-World Glass Cutting Problem -- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic -- Improving Vehicle Routing Using a Customer Waiting Time Colony -- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms -- Improving Edge Recombination through Alternate Inheritance and Greedy Manner -- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm -- On Search Space Symmetry in Partitioning Problems.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Mathematical optimization.
|
650 |
|
0 |
|a Combinatorics.
|
650 |
1 |
4 |
|a Mathematics.
|
650 |
2 |
4 |
|a Optimization.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Numeric Computing.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Combinatorics.
|
700 |
1 |
|
|a Gottlieb, Jens.
|e editor.
|
700 |
1 |
|
|a Raidl, Günther R.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540213673
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3004
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b96499
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|