Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The nicholson principle in discrete dynamic optimization

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

DOI10.1080/02331937908842547zbMath0403.90087OpenAlexW1970893856MaRDI QIDQ4189078

Gertraude Gierth, Johannes Terno

Publication date: 1979

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331937908842547


zbMATH Keywords

Implementation StudyDiscrete Dynamic Programming


Mathematics Subject Classification ID

Dynamic programming (90C39)


Related Items (1)

A note on the solution of group knapsack problems







This page was built for publication: The nicholson principle in discrete dynamic optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4189078&oldid=18027466"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 12:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki