On non-serial dynamic programming (Q2561771)

From MaRDI portal

Revision as of 12:11, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On non-serial dynamic programming	scientific article

Statements

scholarly article

0 references

On non-serial dynamic programming (English)

0 references

0 references

Francesco Brioschi

0 references

Journal of Combinatorial Theory. Series A

0 references

publication date

1973

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0097-3165(73)90016-2

0 references

Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

0 references

A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming

0 references

Contribution to nonserial dynamic programming

0 references

A theorem in nonserial dynamic programming

0 references

0 references

A note on a paper by Spillers and Hickerson

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0097-3165(73)90016-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2561771

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2561771&oldid=34555263"