Methods for Computing the Greatest Common Divisor and Applications in Mathematical Programming.
| dc.contributor.advisor | Modine, Kent A. | |
| dc.contributor.author | MacGregor, Harry Gregor, Jr. | |
| dc.contributor.author | Modine, Kent Allen | |
| dc.contributor.department | Operations Research | |
| dc.date.accessioned | 2012-08-29T23:33:39Z | |
| dc.date.available | 2012-08-29T23:33:39Z | |
| dc.date.issued | 1968-06 | |
| dc.description.abstract | Several methods are presented for determining the greatest common divisor of a set of positive integers by solving the n integer program: find the integers x. that minimize Z = E a.x. i = l subject to Z 2: 1. The methods are programmed for use on a computer and compared with the Euclidean algorithm. Computational results and applications are given. | en_US |
| dc.description.service | Captain, United States Army | en_US |
| dc.description.service | Major, United States Army | en_US |
| dc.description.uri | http://archive.org/details/methodsforcomput1094512659 | |
| dc.identifier.uri | https://hdl.handle.net/10945/12659 | |
| dc.language.iso | en_US | |
| dc.publisher | Monterey, California. Naval Postgraduate School | en_US |
| dc.rights | This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States. | en_US |
| dc.title | Methods for Computing the Greatest Common Divisor and Applications in Mathematical Programming. | en_US |
| dc.type | Thesis | en_US |
| dspace.entity.type | Publication | |
| etd.thesisdegree.discipline | Operations Research | en_US |
| etd.thesisdegree.grantor | Naval Postgraduate School | en_US |
| etd.thesisdegree.level | Masters | en_US |
| etd.thesisdegree.name | M.S. in Operations Research | en_US |