000 03465nam a22005655i 4500
001 978-3-540-49875-9
003 DE-He213
005 20160624102046.0
007 cr nn 008mamaa
008 121227s1996 gw | s |||| 0|eng d
020 _a9783540498759
_9978-3-540-49875-9
024 7 _a10.1007/BFb0027114
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aSolving Combinatorial Optimization Problems in Parallel
_h[electronic resource] :
_bMethods and Techniques /
_cedited by Afonso Ferreira, Panos Pardalos.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
300 _aVII, 280 p.
_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 ;
_v1054
505 0 _aSCOOP: Solving Combinatorial Optimization problems in parallel -- Parallel approximation of optimization problems -- Randomized parallel algorithms -- Automatic synthesis of parallel algorithms -- An introduction to parallel dynamic programming -- Mapping tree-structured combinatorial optimization problems onto parallel computers -- Towards an abstract parallel branch and bound machine -- Parallel best-first branch- and-bound in discrete optimization: A framework -- Building a parallel branch and bound library -- Parallel algorithms for global optimization problems -- Parallel heuristic search — Introductions and a new approach.
520 _aSolving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds. Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.
650 0 _aComputer science.
650 0 _aComputer aided design.
650 0 _aNumerical analysis.
650 0 _aCombinatorics.
650 0 _aManagement information systems.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aNumerical Analysis.
650 2 4 _aCombinatorics.
650 2 4 _aBusiness Information Systems.
650 2 4 _aSystems and Information Theory in Engineering.
650 2 4 _aComputer-Aided Engineering (CAD, CAE) and Design.
700 1 _aFerreira, Afonso.
_eeditor.
700 1 _aPardalos, Panos.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540610434
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1054
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0027114
942 _2EBK6901
_cEBK
999 _c36195
_d36195