Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints-Reference-Cited by-同舟云学术

Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints

Published:2005-02 Issue:3 Volume:160 Page:582-598
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Dubois D.,Fortemps Ph.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference32 articles.

1. On optimal decisions under complete ignorance: A new criterion stronger than both pareto and maxmin;Behringer;European Journal of Operational Research,1977

2. A simplex based algorithm for the lexicographically extended linear maxmin problem;Behringer;European Journal of Operational Research,1981

3. Dynamic Programming;Bellman,1957

4. Applied Dynamic Programming;Bellman,1962

5. Decision-making in a fuzzy environment;Bellman;Management Science,1970

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Provenance Calculus and Possibilistic Logic: A Parallel and a Discussion;Lecture Notes in Computer Science;2023-11-19

2. Qualitative capacities: Basic notions and potential applications;International Journal of Approximate Reasoning;2022-09

3. Possibilistic Logic: From Certainty-Qualified Statements to Two-Tiered Logics – A Prospective Survey;Logics in Artificial Intelligence;2019

4. Separable Qualitative Capacities;Lecture Notes in Computer Science;2018

5. Possibility Theory and Its Applications: Where Do We Stand?;Springer Handbook of Computational Intelligence;2015