|
|
|
|
LEADER |
03301nam a22004095i 4500 |
001 |
978-3-540-70807-0 |
005 |
20191021161649.0 |
007 |
cr nn 008mamaa |
008 |
100301s2008 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540708070
|
024 |
7 |
|
|a 10.1007/978-3-540-70807-0
|2 doi
|
040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
245 |
1 |
0 |
|a Recent Advances in Evolutionary Computation for Combinatorial Optimization
|c edited by Carlos Cotta, Jano van Hemert.
|
250 |
|
|
|a 1st ed. 2008.
|
260 |
# |
# |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
300 |
|
|
|a XVII, 337 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
|
490 |
1 |
|
|a Studies in Computational Intelligence,
|v 153
|
505 |
0 |
|
|a Theory and Methodology -- An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups -- Determining Whether a Problem Characteristic Affects Heuristic Performance -- Performance and Scalability of Genetic Algorithms on NK-Landscapes -- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem -- Hybrid Approaches -- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem -- A Hybrid Optimization Framework for Cutting and Packing Problems -- A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem -- A Memetic-Neural Approach to Discover Resources in P2P Networks -- Constrained Problems -- An Iterative Heuristic Algorithm for Tree Decomposition -- Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM -- Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem -- Scheduling -- Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem -- Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids -- Routing and Travelling Salesman Problems -- Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges -- Algorithms for Large Directed Capacitated Arc Routing Problem Instances -- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem -- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem.
|
650 |
|
0 |
|a Computer-aided engineering.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Operations research.
|
650 |
|
0 |
|a Decision making.
|
650 |
|
0 |
|a Applied mathematics.
|
650 |
|
0 |
|a Engineering mathematics.
|
650 |
1 |
4 |
|a Computer-Aided Engineering (CAD, CAE) and Design.
|
650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
650 |
2 |
4 |
|a Operations Research/Decision Theory.
|
650 |
2 |
4 |
|a Mathematical and Computational Engineering.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Cotta, Carlos.
|e editor.
|
700 |
1 |
|
|a van Hemert, Jano.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-70807-0
|