Dynamic programming with bivalent variables
P. L. Ivanescu (1966)
Matematički Vesnik
Similarity:
Displaying similar documents to “On a general dynamic programming problem”
Dynamic programming with bivalent variables
How to treat decision problems by different programming methodologies
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
Relationship between dynamic programming and the maximum principle under state constraints.
Kim, Kyung-Eung (1999)
Journal of Convex Analysis
Similarity:
Object-agent oriented programming.
Amandi, Analía, Iturregui, Ramiro, Zunino, Alejandro (1999)
Electronic Journal of SADIO [electronic only]
Similarity:
Special issue: Applied mathematical programming and modelling 2016
(2017)
Kybernetika
Similarity:
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Contents of volume 35 issue 3
(2006)
Control and Cybernetics
Similarity:
Integer Programming Formulation of the Bilevel Knapsack Problem
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 ...