On integer linear programming.
Authors
Hobart, Charles Wendell
Subjects
integer programming
knapsack functions
dynamic programming
bounded variables
knapsack functions
dynamic programming
bounded variables
Advisors
Greenberg, Harold
Date of Issue
1968-06
Date
June 1968
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
A survey of the methods of solving the integer program, max summation from j=1 to j=n of the quantity (c sub j x sub j) subject to summation, j=1 to j=n of the quantity (a sub ij x sub j) = b sub i, i=1,...,m, and x sub j = or 0 and integer (j=1,...,n) is presented. Emphasis is placed on methods developed since 1960 with many as yet unpublished methods presented. Examples are given for the unpublished methods.
Type
Thesis
Description
Series/Report No
Department
Operations Analysis
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funding
Format
59 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
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.