Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The computational complexity of some fuzzy dynamic programs

From MaRDI portal
Publication:1963050
Jump to:navigation, search

DOI10.1016/S0898-1221(99)00142-XzbMath0931.90065OpenAlexW1988923303MaRDI QIDQ1963050

Augustine O. Esogbue

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00142-x


zbMATH Keywords

computational complexitymodel implementationfuzzy dynamic programming


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Dynamic programming (90C39)


Related Items

Fuzzy dynamic programming: Main developments and applications ⋮ Optimal clustering of fuzzy data via fuzzy dynamic programming



Cites Work

  • Optimal stopping in a fuzzy environment
  • Decision-making in a Fuzzy environment with Fuzzy termination time
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1963050&oldid=14410017"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki