An Algorithm for the Solution of Zero-One Resource Allocation Problems

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/7322

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Chakravarti, P.C.	en_US
dc.contributor.author	Mowla, Golam	en_US
dc.date.accessioned	2014-06-18T16:38:59Z	-
dc.date.available	2014-06-18T16:38:59Z	-
dc.date.created	2010-07-13	en_US
dc.date.issued	1975-09	en_US
dc.identifier.other	opendissertations/2603	en_US
dc.identifier.other	3597	en_US
dc.identifier.other	1392833	en_US
dc.identifier.uri	http://hdl.handle.net/11375/7322	-
dc.description.abstract	<p>An algorithm is developed for discrete optimization of zero-one resource allocation problems. A single constraint problem is first formulated in dynamic programming. This formulation then undergoes a number of modifications to develop the algorithm. This algorithm leads to a significant reduction in computational requirements as compared to the dynamic programming method. Three theorems and several lemmas are proved which are central in making the algorithm efficient. Different relevant features are included in the study to extend the algorithm to solve problems with more than one constraint.</p>	en_US
dc.subject	Computational Engineering	en_US
dc.subject	Computational Engineering	en_US
dc.title	An Algorithm for the Solution of Zero-One Resource Allocation Problems	en_US
dc.type	thesis	en_US
dc.contributor.department	Computation	en_US
dc.description.degree	Master of Science (MS)	en_US
Appears in Collections:	Open Access Dissertations and Theses

Files in This Item:

File	Size	Format
fulltext.pdf Open Access	1.68 MB	Adobe PDF	View/Open