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

Nearest route problem

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

DOI10.1006/jmaa.2000.6933zbMath0970.90109OpenAlexW2014874590MaRDI QIDQ1584634

Seiichi Iwamoto

Publication date: 14 October 2001

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2000.6933


zbMATH Keywords

dynamic programmingnearest route problem


Mathematics Subject Classification ID

Dynamic programming (90C39)


Related Items

Stochastic optimization of forward recursive functions



Cites Work

  • A note on two problems in connexion with graphs
  • Associative dynamic programs
  • Dynamic programming. Sequential scientific management
  • Graphs, dynamic programming, and finite games
  • Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1584634&oldid=13871664"
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 03:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki