Megson, Graham M.; Rapanotti, Lucia and Chen, Xu
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1007/BFb0027114|
|Google Scholar:||Look up in Google Scholar|
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.
|Item Type:||Book Chapter|
|Copyright Holders:||1996 Springer Verlag|
|Keywords:||combinatorial optimisation; integer programming; mathematical programming; parallel algorithms; parallel approximation|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Lucia Rapanotti|
|Date Deposited:||04 Dec 2009 10:57|
|Last Modified:||04 Oct 2016 10:30|
|Share this page:|