AbstractThis paper describes and analyzes an algorithm which computes an interval of length t in which a minimizer (or a maximizer) of a periodical bimodal function h is located using a minimal number of evaluations of the function h. A dynamic programming approach is used in order to demonstrate the optimality of the algorithm
In an extremal problem, instead of f(x) one has a sequence f(n)(x) of functions approximating in som...
Abstract. Solving dynamic combinatorial problems poses a particular challenge to optimisation algori...
Among the mathematical methods used in economics, a prominent place is occupied by the dynamic progr...
AbstractThis paper describes an optimal algorithm for searching for a minimum (or a maximum) of a di...
AbstractWe consider the problem of locating within a specified tolerance the point at which a unimod...
AbstractGiven n opportunities to evaluate a function which is known to have a root in the unit inter...
In a previous paper [Avriel, M., D. J. Wilde. 1966. Optimal search for a maximum with sequences of s...
We consider the problem of approximating a signal P with another signal F consisting of a few piecew...
A technique is described which allows unimodal function optimization methods to be extended to effic...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Abstract:- A Detecting Peak's Number (DPN) technique is proposed for multimodal optimization. I...
AbstractIn this paper, we address linear bilevel programs when the coefficients of both objective fu...
Abstract: "Finding the Bayesian network that maximizes a score function is known as structure learni...
AbstractWe present a formal systolic algorithm to solve the dynamic programming problem for an optim...
Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional domain. ...
In an extremal problem, instead of f(x) one has a sequence f(n)(x) of functions approximating in som...
Abstract. Solving dynamic combinatorial problems poses a particular challenge to optimisation algori...
Among the mathematical methods used in economics, a prominent place is occupied by the dynamic progr...
AbstractThis paper describes an optimal algorithm for searching for a minimum (or a maximum) of a di...
AbstractWe consider the problem of locating within a specified tolerance the point at which a unimod...
AbstractGiven n opportunities to evaluate a function which is known to have a root in the unit inter...
In a previous paper [Avriel, M., D. J. Wilde. 1966. Optimal search for a maximum with sequences of s...
We consider the problem of approximating a signal P with another signal F consisting of a few piecew...
A technique is described which allows unimodal function optimization methods to be extended to effic...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Abstract:- A Detecting Peak's Number (DPN) technique is proposed for multimodal optimization. I...
AbstractIn this paper, we address linear bilevel programs when the coefficients of both objective fu...
Abstract: "Finding the Bayesian network that maximizes a score function is known as structure learni...
AbstractWe present a formal systolic algorithm to solve the dynamic programming problem for an optim...
Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional domain. ...
In an extremal problem, instead of f(x) one has a sequence f(n)(x) of functions approximating in som...
Abstract. Solving dynamic combinatorial problems poses a particular challenge to optimisation algori...
Among the mathematical methods used in economics, a prominent place is occupied by the dynamic progr...
DOI
Add to ORKG