登入
選單
返回
Google圖書搜尋
Solving Combinatorial Optimization Problems in Parallel
Alfonso Ferreira
Afonso Ferreira
其他書名
Methods and Techniques
出版
Springer
, 1996-03-27
主題
Business & Economics / Information Management
Business & Economics / Business Mathematics
Computers / Design, Graphics & Media / CAD-CAM
Computers / Computer Architecture
Computers / Computer Science
Computers / Information Technology
Computers / Machine Theory
Computers / Management Information Systems
Computers / Distributed Systems / General
Computers / Software Development & Engineering / Systems Analysis & Design
Computers / Hardware / General
Computers / User Interfaces
Computers / Desktop Applications / General
Computers / Parallel Processing
Language Arts & Disciplines / Library & Information Science / General
Mathematics / Applied
Mathematics / Discrete Mathematics
Mathematics / Game Theory
Mathematics / Number Systems
Mathematics / Combinatorics
Mathematics / Numerical Analysis
Science / System Theory
Technology & Engineering / General
Technology & Engineering / Electronics / General
Technology & Engineering / Engineering (General)
ISBN
354061043X
9783540610434
URL
http://books.google.com.hk/books?id=YvQ0HFn5JH0C&hl=&source=gbs_api
註釋
Solving 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.