Article ID: | iaor19941854 |
Country: | Germany |
Volume: | 37 |
Start Page Number: | 257 |
End Page Number: | 272 |
Publication Date: | May 1993 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Jacobson S.H., Solow D. |
This paper investigates the effectiveness of using finite improvement algorithms for solving decision, search, and optimization problems. Finite improvement algorithms operate in a finite number of iterations, each taking a polynomial amount of work, where strict improvement is required from iteration to iteration. The hardware, software, and way of measuring complexity found in the polynomial setting are modified to identify the concept of repetition and define the new classes of decision problems,