By Topic

New Tactics in Solving Catalyst Regeneration Problems and General Resource Allocation by Dynamic Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Harvey J. Greenberg ; Computer Science/Operations Research Center, Institute of Technology, Southern Methodist University, Dallas, Tex. 75222.

Two catalyst regeneration problems are described. The major concern is with the reduction of storage and computations when implementing a dynamic programming strategy. Finally, tactics used in applying dynamic programming to a general resource allocation model are described.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-3 ,  Issue: 2 )