Masters Theses

Abstract

"A technique is presented which finds a fast suboptimal solution to the assignment problem. This same technique is then applied to two large dynamic programming problems for which the optimal solution is not known. These examples illustrate how easily this technique can be applied and that it is better than most optimizing techniques because it is fast, cheap and only minor hand calculations are needed. The effect of different initial solutions and their value are compared and it is found that the initial solution is not as significant in a suboptimal technique as in an optimizing technique. The initial solution is significant enough, however, to warrant some care in choosing it"--Abstract, page ii.

Advisor(s)

Ho, C. Y. (Chung You), 1933-1988

Committee Member(s)

Gillett, Billy E.
Flanigan, V. J.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

1970

Pagination

vi, 49 pages

Note about bibliography

Includes bibliographical references (page 55).

Rights

© 1970 William Barry Gregory, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Library of Congress Subject Headings

Assignment problems (Programming)
Mathematical optimization
Dynamic programming
Control theory

Thesis Number

T 2489

Print OCLC #

6029322

Electronic OCLC #

869554218

Share

 
COinS