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

From MaRDI portal





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.











This page was built for publication: Optimal search algorithm for a minimum of a discrete periodic bimodal function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114409)