๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel approximation schemes for Subset Sum and Knapsack problems

โœ Scribed by Joseph G. Peters; Larry Rudolph

Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
890 KB
Volume
24
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient fully polynomial approximat
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
โœ Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

Given a set of n positive integers and a knapsack of capacity c; the Subset-Sum Problem is to find a subset the sum of which is closest to c without exceeding the value c: In this paper we present a fully polynomial approximation scheme which solves the Subset-Sum Problem with accuracy e in time Oรฐm

A parallel approximation scheme for the
A parallel approximation scheme for the multiprocessor scheduling problem
โœ Ricardo C. Corrรชa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 433 KB

In this paper, a parallel branch-and-bound approach for ยฎnding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ยฎnd solutions to the subproblems enumerated during the