Optimal search algorithm for a minimum of a discrete periodic bimodal function

Document Type

Article

Publication Date

11-24-1988

Abstract

This paper describes an optimal algorithm for searching for a minimum of a discrete periodic bimodal function of period P. Recursive computing is used to prove the optimality of the search algorithm. An application of the algorithm for a partition analysis of a communication network is provided. © 1988.

Identifier

0024107583 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/0020-0190(88)90115-9

ISSN

00200190

First Page

233

Last Page

239

Issue

5

Volume

29

This document is currently not available here.

Share

COinS