Optimal search algorithm for extrema of a discrete periodic bimodal function

Document Type

Article

Publication Date

1-1-1989

Abstract

This paper describes an optimal algorithm for searching for a minimum (or a maximum) 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 clustering analysis of a data communication network is provided. © 1989.

Identifier

45149142174 (Scopus)

Publication Title

Journal of Complexity

External Full Text Location

https://doi.org/10.1016/0885-064X(89)90006-X

e-ISSN

10902708

ISSN

0885064X

First Page

238

Last Page

250

Issue

2

Volume

5

This document is currently not available here.

Share

COinS