scientific article; zbMATH DE number 5152602

MaRDI QIDQ3437244zbMATH OpenFDO

Authors Moshe Sniedovich

Publication date 14 May 2007

Full work available at URL https://eudml.org/doc/209437

zbMATH Keywords

Dijkstra's algorithmdynamic programmingshortest path problemsuccessive approximation

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Programming involving graphs or networks (90C35)

Cited in

(9)

• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
• A framework for optimization under limited information
• Probabilistic model based path planning
• A nonlinear data-driven reduced order model for computational homogenization with physics/pattern-guided sampling
• Dijkstra's algorithm and L-concave function maximization
• A nonlinear manifold-based reduced order model for multiscale analysis of heterogeneous hyperelastic materials
• Influence prediction for continuous-time information propagation on networks
• A Lasso-alternative to Dijkstra's algorithm for identifying short paths in networks
• Heuristic search for linear positive systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437244)