On a Dynamic Programming Approach to the Caterer Problem—I

DOI10.1287/mnsc.3.3.270zbMath0995.90618OpenAlexW1980772289MaRDI QIDQ2778582

Richard Bellman

Publication date: 12 May 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.3.3.270

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (18)

Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ On the dynamic programming approach to the 'caterer' problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal lot size determination of multistage production system ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Foundations of multistage system optimization ⋮ Unnamed Item ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On linear statistical problems in stochastic processes

This page was built for publication: On a Dynamic Programming Approach to the Caterer Problem—I