AbstractThis report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programming approach with fathoming by bounds and by infeasibility
IS. KEY WORDS (Continu * on ravara * aldm II nacaaaarr and Idmntify bf block nun*aO Multicriterion o...
The article discusses a numerical approach to solve optimal control problems in discrete time that i...
This thesis is a survey of the present status of the mathematical aspects of dynamic Programming. Dy...
AbstractThis report concerns a discrete mathematical programming problem in which the variables are ...
AbstractSeveral interactive schemes for solving multicriteria discrete programming problems are deve...
The investigation reported in this dissertation attempts to determine the feasibility of using a dis...
This work presents a multi-objective differential dynamic programming approach to constrained discre...
We consider a discrete time Markov Decision Process, where the objectives are linear combinations of...
AbstractSeveral interactive schemes for solving multicriteria discrete programming problems are deve...
This paper presents the novel deterministic dynamic programming approach for solving optimization pr...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Dynamic programming is a mathematical technique which provides a systematic procedure for determinin...
The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm f...
In certain problem areas it is not possible to establish one objective function. There may be severa...
IS. KEY WORDS (Continu * on ravara * aldm II nacaaaarr and Idmntify bf block nun*aO Multicriterion o...
The article discusses a numerical approach to solve optimal control problems in discrete time that i...
This thesis is a survey of the present status of the mathematical aspects of dynamic Programming. Dy...
AbstractThis report concerns a discrete mathematical programming problem in which the variables are ...
AbstractSeveral interactive schemes for solving multicriteria discrete programming problems are deve...
The investigation reported in this dissertation attempts to determine the feasibility of using a dis...
This work presents a multi-objective differential dynamic programming approach to constrained discre...
We consider a discrete time Markov Decision Process, where the objectives are linear combinations of...
AbstractSeveral interactive schemes for solving multicriteria discrete programming problems are deve...
This paper presents the novel deterministic dynamic programming approach for solving optimization pr...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Edited by P. Perny and A. TsoukiasInternational audienceDynamic Programming is a powerful approach t...
Dynamic programming is a mathematical technique which provides a systematic procedure for determinin...
The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm f...
In certain problem areas it is not possible to establish one objective function. There may be severa...
IS. KEY WORDS (Continu * on ravara * aldm II nacaaaarr and Idmntify bf block nun*aO Multicriterion o...
The article discusses a numerical approach to solve optimal control problems in discrete time that i...
This thesis is a survey of the present status of the mathematical aspects of dynamic Programming. Dy...