DSpace Repository

The parallel solution of some discrete optimization problems

Show simple item record

dc.contributor.author Loots W en
dc.date.accessioned 2016-09-22T09:55:51Z
dc.date.available 2016-09-22T09:55:51Z
dc.date.created 1991 en
dc.date.submitted 1992 en
dc.identifier.uri http://hdl.handle.net/20.500.11892/66134
dc.description.abstract Aims at the parallel solution of two discrete optimisation problems, namely the 0-1 rucksack problem (0-1KP) and the symmetrical commercial traveller's problem (SHP). The solution of the 0-1KP requires that the objects be sorted, and for this reason the parallel solution of the sorting problem was also addressed. Parallel algorithms are proposed for each of the three problems, and the experimental results obtained on a transputer network are reported. The parallel algorithms are new algorithms, mostly combinations of sequential algorithms or based on these algorithms, e.g. the branch-and-cut algorithm. The results were obtained by using these algorithms on an existing parallel computer, not simulation of a parallel algorithm on a sequential computer, and indicate a suitability for large-scale problems. en
dc.language English en
dc.subject Mathematics, Mathematical statistics and Statistics en
dc.subject Numerical analysis and computer methods en
dc.title The parallel solution of some discrete optimization problems en
dc.type Masters degree en
dc.description.degree MSc en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record