Hybrid Metaheuristics 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bartz-Beielstein, Thomas (Επιμελητής έκδοσης), Blesa Aguilera, María José (Επιμελητής έκδοσης), Blum, Christian (Επιμελητής έκδοσης), Naujoks, Boris (Επιμελητής έκδοσης), Roli, Andrea (Επιμελητής έκδοσης), Rudolph, Günter (Επιμελητής έκδοσης), Sampels, Michael (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4771
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03534nam a22006255i 4500
001 978-3-540-75514-2
003 DE-He213
005 20151204160355.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540755142  |9 978-3-540-75514-2 
024 7 |a 10.1007/978-3-540-75514-2  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Hybrid Metaheuristics  |h [electronic resource] :  |b 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings /  |c edited by Thomas Bartz-Beielstein, María José Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a X, 201 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 4771 
505 0 |a Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
650 0 |a Artificial intelligence. 
650 0 |a Pattern recognition. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Pattern Recognition. 
700 1 |a Bartz-Beielstein, Thomas.  |e editor. 
700 1 |a Blesa Aguilera, María José.  |e editor. 
700 1 |a Blum, Christian.  |e editor. 
700 1 |a Naujoks, Boris.  |e editor. 
700 1 |a Roli, Andrea.  |e editor. 
700 1 |a Rudolph, Günter.  |e editor. 
700 1 |a Sampels, Michael.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540755135 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4771 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-75514-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)