On a general dynamic programming problem
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
P. L. Ivanescu (1966)
Matematički Vesnik
Similarity:
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kim, Kyung-Eung (1999)
Journal of Convex Analysis
Similarity:
(2017)
Kybernetika
Similarity:
Amandi, Analía, Iturregui, Ramiro, Zunino, Alejandro (1999)
Electronic Journal of SADIO [electronic only]
Similarity:
R. Mansi, S. Hanafi, L. Brotcorne (2010)
Mathematical Modelling of Natural Phenomena
Similarity:
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...
(2006)
Control and Cybernetics
Similarity: