Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A combinatorial structure ensuring applicability of the dynamic programming method

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

zbMath0705.90090MaRDI QIDQ918440

N. V. Bagotskaya, I. S. Losev, Vadim E. Levit

Publication date: 1989

Published in: Automation and Remote Control (Search for Journal in Brave)



zbMATH Keywords

matroidshortest path algorithmbranching greedy algorithmfibroid


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (1)

Critical sets, crowns and local maximum independent sets







This page was built for publication: A combinatorial structure ensuring applicability of the dynamic programming method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:918440&oldid=12886138"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 17:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki