Author: Alfred G. Burns
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 320
Book Description
A Parallel Algorithm for the Multidimensional Knapsack Problem
Author: Alfred G. Burns
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 320
Book Description
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 320
Book Description
A Parallel Algorithm for the Multi-constrained Knapsack Problem
Parallel Algorithms for Knapsack Type Problems
Author: Vassil Alexandrov
Publisher: World Scientific
ISBN: 9789810221201
Category : Computers
Languages : en
Pages : 222
Book Description
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.
Publisher: World Scientific
ISBN: 9789810221201
Category : Computers
Languages : en
Pages : 222
Book Description
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.
Knapsack Problems
Author: Hans Kellerer
Publisher: Springer Science & Business Media
ISBN: 3540247777
Category : Mathematics
Languages : en
Pages : 557
Book Description
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
Publisher: Springer Science & Business Media
ISBN: 3540247777
Category : Mathematics
Languages : en
Pages : 557
Book Description
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
A Parallel Algorithm for the Knapsack Problem
Author: International Business Machines Corporation. Research Division
Publisher:
ISBN:
Category :
Languages : en
Pages : 18
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 18
Book Description
Transputer Research and Applications 7
Author: North American Transputer Users Group. Conference
Publisher: IOS Press
ISBN: 9789051991871
Category : Computers
Languages : en
Pages : 364
Book Description
This work comprises the proceedings of the Transputer Research and Applications Conference held in Georgia from October 23rd to October 25th, 1994. The conference is sponsored by the North American Transputer Users Group (NATUG).
Publisher: IOS Press
ISBN: 9789051991871
Category : Computers
Languages : en
Pages : 364
Book Description
This work comprises the proceedings of the Transputer Research and Applications Conference held in Georgia from October 23rd to October 25th, 1994. The conference is sponsored by the North American Transputer Users Group (NATUG).
Parallel Computing
Author: Christian Bischof
Publisher: IOS Press
ISBN: 158603796X
Category : Computers
Languages : en
Pages : 824
Book Description
ParCo2007 marks a quarter of a century of the international conferences on parallel computing that started in Berlin in 1983. The aim of the conference is to give an overview of the developments, applications and future trends in high-performance computing for various platforms.
Publisher: IOS Press
ISBN: 158603796X
Category : Computers
Languages : en
Pages : 824
Book Description
ParCo2007 marks a quarter of a century of the international conferences on parallel computing that started in Berlin in 1983. The aim of the conference is to give an overview of the developments, applications and future trends in high-performance computing for various platforms.
A Parallel Algorithm for the 0/1 Knapsack Problem
Author: Ping Zhang
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 402
Book Description
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 402
Book Description
Bioinspired Heuristics for Optimization
Author: El-Ghazali Talbi
Publisher: Springer
ISBN: 3319951041
Category : Technology & Engineering
Languages : en
Pages : 314
Book Description
This book presents recent research on bioinspired heuristics for optimization. Learning- based and black-box optimization exhibit some properties of intrinsic parallelization, and can be used for various optimizations problems. Featuring the most relevant work presented at the 6th International Conference on Metaheuristics and Nature Inspired Computing, held at Marrakech (Morocco) from 27th to 31st October 2016, the book presents solutions, methods, algorithms, case studies, and software. It is a valuable resource for research academics and industrial practitioners.
Publisher: Springer
ISBN: 3319951041
Category : Technology & Engineering
Languages : en
Pages : 314
Book Description
This book presents recent research on bioinspired heuristics for optimization. Learning- based and black-box optimization exhibit some properties of intrinsic parallelization, and can be used for various optimizations problems. Featuring the most relevant work presented at the 6th International Conference on Metaheuristics and Nature Inspired Computing, held at Marrakech (Morocco) from 27th to 31st October 2016, the book presents solutions, methods, algorithms, case studies, and software. It is a valuable resource for research academics and industrial practitioners.
Applied Soft Computing Technologies: The Challenge of Complexity
Author: Ajith Abraham
Publisher: Springer Science & Business Media
ISBN: 3540316620
Category : Computers
Languages : en
Pages : 838
Book Description
This volume presents the proceedings of the 9th Online World Conference on Soft Computing in Industrial Applications, held on the World Wide Web in 2004. It includes lectures, original papers and tutorials presented during the conference. The book brings together outstanding research and developments in soft computing, including evolutionary computation, fuzzy logic, neural networks, and their fusion, and its applications in science and technology.
Publisher: Springer Science & Business Media
ISBN: 3540316620
Category : Computers
Languages : en
Pages : 838
Book Description
This volume presents the proceedings of the 9th Online World Conference on Soft Computing in Industrial Applications, held on the World Wide Web in 2004. It includes lectures, original papers and tutorials presented during the conference. The book brings together outstanding research and developments in soft computing, including evolutionary computation, fuzzy logic, neural networks, and their fusion, and its applications in science and technology.