Conference paper
A dynamic programming approach to sequencing problems
Michael Held, Richard M. Karp
ACM National Meeting 1961
We consider the problem of locating within a specified tolerance the point at which a unimodal function of one variable assumes its maximum value. Parallel search policies are considered in which a sequence of k-tuples of function evaluations is made, with the selection of each k-tuple dependent on the outcomes of all previous function evaluations. Search policies for the maximum are obtained which are optimal in the minimax sense. © 1968 Academic Press Inc.
Michael Held, Richard M. Karp
ACM National Meeting 1961
Richard M. Karp
IEEE Transactions on Electronic Computers
Peter R. Cappello, Willard L. Miranker
IEEE TC
Phillip B. Gibbons, Richard M. Karp, et al.
Discrete Applied Mathematics