Back to search

McMaster University

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

Abstract

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>

Degree

thesis:*
Department dc:contributor.department
Computation
Year dc:date.issued
1975

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mowla, Golam
Advisor dc:contributor.advisor
  • Chakravarti, P.C.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/2603
3597
1392833

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Mowla, Golam. An Algorithm for the Solution of Zero-One Resource Allocation Problems. 1975. http://hdl.handle.net/11375/7322