Optimal paths in oriented graphs and eigenvectors in max-⊗ systems

DOI10.1515/DMA.2009.028zbMath1261.90080MaRDI QIDQ3225886

Vladimir Matveenko

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

Bellman value functioncharacteristic pair of a path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Economic growth models (91B62) Paths and cycles (05C38)

Cites Work

• Strong linear independence in bottleneck algebra
• Eigenvectors in Bottleneck algebra
• Resolution of eigen fuzzy sets equations
• ENDOMORPHISMS OF SEMIMODULES OVER SEMIRINGS WITH AN IDEMPOTENT OPERATION
• The structure of optimal trajectories of a discrete deterministic system with discounting
• On discrete sublinear and superlinear operators

This page was built for publication: Optimal paths in oriented graphs and eigenvectors in max-⊗ systems