We are upgrading the repository! A content freeze is in effect until December 6th, 2024 - no new submissions will be accepted; however, all content already published will remain publicly available. Please reach out to repository@u.library.arizona.edu with your questions, or if you are a UA affiliate who needs to make content available soon. Note that any new user accounts created after September 22, 2024 will need to be recreated by the user in November after our migration is completed.
The modified covering problem on paths and trees
| dc.contributor.advisor | Goldberg, Jeffrey B. | en_US |
| dc.contributor.author | Lunday, Brian Joseph | |
| dc.creator | Lunday, Brian Joseph | en_US |
| dc.date.accessioned | 2013-05-16T09:38:37Z | |
| dc.date.available | 2013-05-16T09:38:37Z | |
| dc.date.issued | 2001 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/291733 | |
| dc.description.abstract | The Modified Covering Problem (MCP) is introduced and theory is developed for solving it on paths and trees. First, the Modified Covering Problem is defined as a subset of the Conditional Covering Problem, and motivations are proposed for its study. Next, a literature review examines relevant, published material. The MCP is then formulated as a binary integer program, followed by an examination of the characteristics of its feasible solutions, optimality, and overall complexity. A polynomial algorithm is developed for the solving the MCP on paths with uniform link distances, and solving within 20% of optimality on paths with non-uniform link distances. Next, an exponential algorithm is developed to solve non-uniform link distance problems to optimality. The theory is then further expanded to construct an algorithm to develop strong upper and lower bounds for the optimal solution on trees with non-uniform link distances. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Mathematics. | en_US |
| dc.subject | Engineering, System Science. | en_US |
| dc.subject | Operations Research. | en_US |
| dc.title | The modified covering problem on paths and trees | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1405048 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Systems and Industrial Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b41926237 | en_US |
| refterms.dateFOA | 2018-08-30T02:01:19Z | |
| html.description.abstract | The Modified Covering Problem (MCP) is introduced and theory is developed for solving it on paths and trees. First, the Modified Covering Problem is defined as a subset of the Conditional Covering Problem, and motivations are proposed for its study. Next, a literature review examines relevant, published material. The MCP is then formulated as a binary integer program, followed by an examination of the characteristics of its feasible solutions, optimality, and overall complexity. A polynomial algorithm is developed for the solving the MCP on paths with uniform link distances, and solving within 20% of optimality on paths with non-uniform link distances. Next, an exponential algorithm is developed to solve non-uniform link distance problems to optimality. The theory is then further expanded to construct an algorithm to develop strong upper and lower bounds for the optimal solution on trees with non-uniform link distances. |
