| 000 | 03566nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-16054-7 | ||
| 003 | DE-He213 | ||
| 005 | 20140220084548.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 101001s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642160547 _9978-3-642-16054-7 |
||
| 024 | 7 |
_a10.1007/978-3-642-16054-7 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aBlesa, María J. _eeditor. |
|
| 245 | 1 | 0 |
_aHybrid Metaheuristics _h[electronic resource] : _b7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings / _cedited by María J. Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_aX, 223p. 43 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6373 |
|
| 505 | 0 | _aA Hybrid Metaheuristic for the Longest Common Subsequence Problem -- Hybrid Algorithms for the Variable Sized Bin Packing Problem -- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model -- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem -- A New Approach for Solving the Generalized Traveling Salesman Problem -- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem -- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem -- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents -- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem -- An Improved Memetic Algorithm for Break Scheduling -- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem -- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem -- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem -- SearchCol: Metaheuristic Search by Column Generation -- Survey: Matheuristics for Rich Vehicle Routing Problems. | |
| 520 | _aThis book constitutes the refereed proceedings of the 7th International Workshop on Hybrid Metaheuristics, HM 2010, held in Vienna, Austria, in October 2010. The 14 revised full papers presented were carefully reviewed and selected from 29 submissions. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aLogic design. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aComputation by Abstract Devices. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 700 | 1 |
_aBlum, Christian. _eeditor. |
|
| 700 | 1 |
_aRaidl, Günther. _eeditor. |
|
| 700 | 1 |
_aRoli, Andrea. _eeditor. |
|
| 700 | 1 |
_aSampels, Michael. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642160530 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6373 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-16054-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 |
_c112762 _d112762 |
||