000 | 03824nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-642-16054-7 | ||
003 | DE-He213 | ||
005 | 20240730191511.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 |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aHybrid Metaheuristics _h[electronic resource] : _b7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings / _cedited by Maria José Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aX, 223 p. 43 illus. _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 ; _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. | |
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 1 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aTheory of Computation. _9146297 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
700 | 1 |
_aBlesa, Maria José. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146298 |
|
700 | 1 |
_aBlum, Christian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146299 |
|
700 | 1 |
_aRaidl, Günther. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146300 |
|
700 | 1 |
_aRoli, Andrea. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146301 |
|
700 | 1 |
_aSampels, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146302 |
|
710 | 2 |
_aSpringerLink (Online service) _9146303 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642160530 |
776 | 0 | 8 |
_iPrinted edition: _z9783642160554 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6373 _9146304 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-16054-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93767 _d93767 |