{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/7322"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/7322","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"An Algorithm for the Solution of Zero-One Resource Allocation Problems","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Mowla, Golam"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computation","school":null,"contributors":[],"advisors":["Chakravarti, P.C."],"committee_chairs":[],"committee_members":[],"year":1975,"date_issued":"1975-09","date_published":"1975-09","updated_at":"2026-11-18T19:38:47Z","subjects":["Computational Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/21935"],"render_values":[{"text":"https://doi.org/10.71548/21935","href":"https://doi.org/10.71548/21935","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2603","3597","1392833"],"render_values":[{"text":"opendissertations/2603","href":null,"code":true},{"text":"3597","href":null,"code":true},{"text":"1392833","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/7322","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/7322","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F7322","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chakravarti, P.C."]},{"key":"dc:contributor.department","label":"Department","values":["Computation"]},{"key":"dc:creator","label":"Author","values":["Mowla, Golam"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:38:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:38:59Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-07-13"]},{"key":"dc:date.issued","label":"Date","values":["1975-09"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computational Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2603","3597","1392833"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/7322","https://doi.org/10.71548/21935"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MS)"]},{"key":"dc:title","label":"Title","values":["An Algorithm for the Solution of Zero-One Resource Allocation Problems"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chakravarti, P.C."],"dc:contributor.department":["Computation"],"dc:creator":["Mowla, Golam"],"dc:date.accessioned":["2014-06-18T16:38:59Z"],"dc:date.available":["2014-06-18T16:38:59Z"],"dc:date.created":["2010-07-13"],"dc:date.issued":["1975-09"],"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>"],"dc:description.degree":["Master of Science (MS)"],"dc:identifier.other":["opendissertations/2603","3597","1392833"],"dc:identifier.uri":["http://hdl.handle.net/11375/7322","https://doi.org/10.71548/21935"],"dc:subject":["Computational Engineering"],"dc:title":["An Algorithm for the Solution of Zero-One Resource Allocation Problems"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:38:47Z"}