The index below is based on the Table tag of HTML 3.0. Click the letter of the desired last name of the first author.If your browser does not support this feature you'll have to do it the hard way.

A | B | C | D | E | F | G | H | I |

J | K | L | M | N | O | P | Q | R |

S | T | U | V | W | X | Y | Z |

Abdul-Razaq, T.S. and Potts C.N., Dynamic programming state-space relaxation
for single-machine scheduling, *Journal of the Operational Research
Society*, 39(2), 141-152, 1988.

Abrams, R.A. and Karmarkar, U.S., Infinite horizon investment-consumption
policies, *Management Science*, 25(10), 1005-1013, 1979.

Agresti, W.W., Dynamic programming for computer register allocation, *
Computers and Operations Research*, 4, 101-110, 1977.

Alstrup, J., Boas, S., Madsen O.B.G. and Vidal R.V.V., Booking policy for
flights with two types of passengers, *European Journal of Operational
Research*, 27, 274-288, 1986.

Andreatta, G. and Romero, L., Stochastic shortest paths with recourse, *
Networks*, 18, 193-204, 1988.

Angel, E., Dynamic programming for noncausal problems, *IEEE
Transactions on Automatic control*, 1981.

Angel, E., From dynamic programming to fast transforms, *Journal of
Mathematical Analysis and Applications*, 119, 82-89, 1986.

Aoki, M., Adaptive control theory: survey and potential applications to
decision processes, *Decision Science*, 10, 666-687, 1979.

Arunkumar, S., Characterization of optimal operating policies for finite
dams, *Journal of Mathematical Analysis And Applications*, 49,2,
267-274, 1975.

Aust, R.J., Dynamic programming branch and bound algorithm for pure integer
programming, *Computers and Operations Research*, 3, 27-28, 1976.

Axsater, S., State aggregation in dynamic programming -- an application to
scheduling of independent jobs on parallel processors, *it Operations
Research Letters*, 2, 171-176, 1983.

Axsater, S., An extension of the extended basic period approach for economic
lot scheduling problems, *Journal of Optimization Theory and Applications
*, 52(2), 179-189, 1987.

Baetz, B.W., Pas E.I., and Neebe, A.W., Trash management: sizing and timing
decisions for incineration and landfill facilities, *Interfaces * 19(6),
52-61, 1989.

Balcer, Y., Partially controlled demand and inventory control: an additive
model, * Naval Research Logistics Quarterly*, 27(2), 273-288, 1980.

Balder, E.J., A new look at the existence of e-optimal policies in dynamic
programming, *Mathematics of Operations Research*, 6, 513-317, 1981.

Baldwin, J.F. and Pilsworth, B.W., Dynamic programming for fuzzy systems
with fuzzy environment, *Journal of Mathematical Analysis and
Applications*, 85, 1-23, 1982.

Barto, A.G., Bradtke, S.J. and Singh, S.P., Learning to Act using
Real-Time Dynamic Programming, * Artificial Intelligence*, 72(1-2),
81-138, 1995.

Baziw, J. and Scherer C.R., Wastewater treatment capacity expansion with
time varying assimilative constraints, *Water Resources Research*,
15(2), 219-227, 1979.

Bean,J.C., Birge, J.R. and Smith, R.L., Aggregation in dynamic programming,
* Operations Research*, 35(2), 215-220, 1987.

Bellman, R., On the theory of dynamic programming, *Proceedings of the
National Academy of Sciences*, 38, 716-719, 1952.

Bellman, R., Bottleneck problems and dynamic programming, *Proceedings
of the National Academy of Sciences*, 39, 947-951, 1953b.

Bellman, R., Some functional equations in the theory of dynamic programming,
*Proceedings of the National Academy of Sciences*, 39, 1077-1082, 1953c.

Bellman, R., The theory of dynamic programming, *Bulletin of the American Mathematical Society*, 60, 503-515, 1954a.

Bellman, R., Some problems in the theory of dynamic programming, *
Econometrica*, 22, 37-48, 1954b.

Bellman, R., Some applications of the theory of dynamic programming,*
Operations Research*, 2, 275-288, 1954c.

Bellman, R., Dynamic programming and Lagrange multipliers, *Proceedings
of the National Academy of Sciences*, 42, 767-769, 1956.

Bellman, R., Dynamic programming and the smoothing problem, *Management
Science*, 3, 11-113, 1956-7.

Bellman, R., On a dynamic programming approach to the caterer problem --- I,
*Management Science*, 3, 270-278, 1956-7.

Bellman, R., Dynamic programming and the numerical solution of variational
problems, *Operations Research*, 5, 277-288, 1957b.

Bellman, R., A Markovian decision process, *Journal of Mathematics and
Mechanics*, 6(5), 679-684, 1957c.

Bellman, R., On the concepts of a problem and problem-solving, *American
Mathematical Monthly*, 67, 119-134,1960.

Bellman, R., On the reduction of dimensionality for classes of dynamic
programming processes, *Journal of Mathematical Analysis and Applications
*, 3, 358-360, 1961a.

Bellman, R., On the application of dynamic programming to the determination
of optimal play in chess and checkers, *Proceedings of the National
Academy of Sciences*, 53, 244-247, 1965a.

Bellman, R., Dynamic programming, generalized states, and switching systems,
*Journal of Mathematical Analysis and Applications*, 12, 360-363, 1965b.

Bellman, R., An application of dynamic programming to the coloring of maps,
*ICC Bulletin*, 4, 3-6, 1965c.

Bellman, R., Dynamic programming, pattern recognition and location of faults
in complex systems, *Journal of Applied Probability*, 3, 268-271, 1966.

Bellman, R., Dynamic programming: a reluctant theory, pp.99-122, in *New
Methods of Thought and Procedure*, Zwicky F. and Wilson, A.G. editors,
Springer-Verlag, New York, 1967.

Bellman, R., Dynamic programming, and Lewis Carrol's game of doublets, *
Bulletin of the Institute of Mathematics and its Applications*, 17, 86-87,
1968.

Bellman, R., A note on cluster analysis and dynamic programming, *
Mathematical Bioscience*, 18, 311-312, 1973.

Bellman, R. and Kalaba, R., On the principle of invariant imbedding and the
propagation through inhomogeneous media, *Proceedings of the National
Academy of Sciences*, 42, 629-632, 1956.

Bellman, R. and Kalaba, R., An inverse problem in dynamic programming and
automatic control, *Journal of Mathematical Analysis and Applications*,
7, 322-325, 1963.

Bellman, R., Kalaba, R. and Kotkin, B., Polynomial approximation --- a new
computational technique in dynamic programming\ ---\ allocation processes,
*Mathematics and Computation*, 155-161, 1963.

Bellman, R. and E.S. Lee, Functional equations in dynamic programming, *
Aequationes Mathematicae*, 17, 1-18, 1978.

Bellman, R. and Roosta, M., A technique for the reduction of dimensionality
in dynamic programming, *Journal of Mathematical Analysis and
Applications*, 88, 543-546, 1982.

Bellman, R., Sugiyama, H. and Kashef, B., Applications of dynamic programm
ing and scan-rescan processes to nuclear medicine and tumor detection, *
Mathematical Biosciences*, 21, 1-30, 1974.

Bellman, R. and Zadeh, L.A., Decision-making in a fuzzy environment, *
Management Science*, 17, 141-164, 1970.

Benzig, H., Bounds for the approximation of dynamic programming, *
Zeitschrift fur Operations Research*, 30, 65-77, 1986.

Benzig, H., Kalin, D., and Heodorescu, R., On the Bernoulli three-armed
bandit problem, *Optimization*, 17, 807-817, 1986.

Bhakta, P.C., and Mitra, S., Some existence theorems for functional
equations arising in dynamic programming, *Journal of Mathematical
Analysis and Applications*, 98, 348-362, 1984.

Bhatt, B.K. and Rosenbloom, E.S., A dynamic programming approach to
generalized linear fractional programs, *Cahier du CERO*, 27, 207-212, 1985.

Blackwell, D., On the functional equation of dynamic programming, *
Journal of Mathematical Analysis and Applications*, 2, 273-276, 1961.

Blackwell, D., Discrete dynamic programming, *Annals of Mathematical
Statistics*, 33, 719-726, 1962.

Blackwell, D., Memoryless strategies in finite-stage dynamic programming,
*Annals of Mathematical Statistics*, 35, 863-865, 1964.

Blackwell, D., Discounted dynamic programming, *Annals of Mathematical
Statistics *, 36, 226-235, 1965.

Boltyanskii, V.G., Sufficient conditions for optimality and the
justification of the dynamic programming method, *SIAM Journal of Control
*, 4, 326-361, 1966.

Bouzaher, A., Braden, J.B., and Johnson,G.V., A dynamic programming approach
to a class of nonpoint source pollution control problems, *Management
Science*, 36(1), 1-15, 1990.

Bradford, A.D. and Gero, J.S., Quantized feedforward and feedback
information for dynamic programming problems, *Engineering Optimization*
, 4, 227-228, 1980.

Bricker, D.L., Coding dynamic programming in APL, Paper WED/A.15.01, Proceedings of the 12-h International Symposium on Mathematical Programming, Cambridge, Massachusetts, August 5-9, 1985.

Broin, M. and Morin, T.L., DIP-Interactive dynamic programming software,
Paper No.\ WA27.5 TIMS/ORSA Meeting, Chicago, April 1983, *TIMS/ORSA
Bulletin *, 15, p.187, 1983.

Brown, T.A. and Strauch, R.E., Dynamic programming in multiplicative
lattices, *Journal of Mathematical Analysis and Applications*, 12,
364-370, 1965.

Buchanan, J.T., Alternative solution methods for the inventory replenishment
problem under increasing demand, *Journal of the Operational Research
Society*, 31, 615-620, 1980.

Buhl, H.U., Generalizations and applications of a class of dynamic
programming problems, *European Journal of Operational Research*, 31,
127-131, 1987.

Busby, H.R., and Trujillo, D.M., Numerical experiments with a new
differentiation filter", *ASME Journal of Biomechanical Engneering*, 107,
293-299, 1985.

Busby, H.R., and Trujillo, D.M., Numerical solution to a two-
dimensional inverse heat conduction problem", * International
Journal for Numerical Methods in Engineering*, 21, 349-359, 1985.

Busby, H.R., and Trujillo, D.M., Solution of an inverse dynamics
problem using an eigenvalue reduction technique, *Computers and
Structures*, 25(1), 109-117, 1987.

Busby, H.R., Dohrmann, C.R., and Trujillo, D.M., Frequency analysis
of an optimal smoothing and differentiating filter, * Mechanical
Systems and Signal Processing*, 3(4), 361-371, 1989.

Caccetta, L. and Giannini, L.M., An application of discrete mathematics in
the design of an open pit mine, *Discrete Applied Mathematics*, 21,
1-19, 1988.

Caplin, D.A. and Kornbluth, J.S.H., Multiobjective investment planning under
uncertainty, *Omega*, 3(4), 423-441, 1975.

Carraway, R.L., and Morin, T.L., Theory and applications of generalized
dynamic programming: an overview, *International Journal of Computers
and Mathematics with Applications*, 16, 779-788, 1988.

Carraway R.L., Morin, T.L., and Moskowitz, H., Generalized dynamic
programming for multicriteria optimization, *European Journal of
Operational Research*, 44, 95-104, 1990.

Chand, S. and Schneeberger, H. Single machine scheduling to minimize
weighted earliness subject to no tardy jobs, *European Journal of
Operational Research*, 34, 221-230, 1988.

Chankong, V. and Haimes,Y.Y., A multiobjective dynamic programming method
for capacity expansion, * IEEE Transactions on Automatic Control*, 26(5),
1195-1207, 1981.

Chen, J., Lee, F.N., Breipohl, A.M. and Adapa, R., Scheduling direct load
control to minimize system operational cost, *IEEE Transactions on Power
Systems*, 10(4), 1994-2001, 1995.

Chow, G.C., The Lagrange method of optimization with applications to
portfolio and investment decisions, * Journal of Economic Dynamics &
Control*, 20(1-3), 1-18, 1996.

Chow, V.T., Maidment, D.R. and Tauxe, G.W., Computer time and memory
requirements for DP and DDDP in water Resources systems analysis, *Water
Resources Research*, 11, 621-628, 1975.

Christensen, G.S. and Soliman, S.A., Long-term optimal operation of a
parallel multireservoir power system, *Journal of Optimization Theory
and Applications*, 50(3), 383-395, 1986.

Christofides, N., Mingozzi, A., and Toth, P., Exact algorithms for the
vehicle routing problem, based on spanning tree and shortest path
relaxations, *Mathematical Programming*, 20, 255-282, 1981.

Clement, M.F., Categorical axiomatics of dynamic programming, * Journal of
Mathematical Analysis and Applications*, 51, 47-55, 1975.

Cohen, M.A., Pierskalla,W.P. and Namias, S., A dynamic inventory system with
cycling, * Naval Research Logistics Quarterly*, 27(2), 289-296, 1980.
Collins, D.C., Reduction of dimensionality in dynamic programming via the
method of diagonal decomposition, * Journal of Mathematical Analysis and
Applications*, 30, 223-234, 1970.

Collins, D.C., Terminal state dynamic programming for differential
equations, * Journal of Mathematical Analysis and Applications*, 31,
487-503, 1970.

Cooper, M.W., The use of dynamic programming methodology for the solution of
a class of nonlinear programming problems, * Naval Research Logistics
Quarterly*, 27, 89-95, 1980.

Coskunoglu, O and Parent, P., Piecewise smooth dynamic programming applica
tion to a casing design for ultradeep drills, * Engineering Optimization*
, 5, 249-256, 1982.

Crowder, H., Mathematical programming algorithms in APL, in J.M. Mulvey
(ed.), * Evaluating Mathematical Programming Techniques*, Springer
Verlag, New York, 290-304, 1982.

Daellenbach, H.G. and De Kluyver, C.A., Note on multiple objective dynamic
programming, * Journal of the Operational Research Society*, 31, 591-594,
1980.

Dajani, J.S., Hasit, Y. and McCullers, S.D., Mathematical programming in
sewer network design, * Engineering Optimization*, 3, 27-35, 1977.

Davis, K.R., and Simmons, L.F., Improving assembly line efficiency: a
dynamic programming-heuristic approach, * Computers and Operations
Research*, 4, 75-87, 1977.

Dawn, R.V., Pointwise and uniformly good stationary strategies for dynamic
programming models, * Mathematics of Operations Research*, 11(3),
521-535, 1986.

Denardo, E.V., Contraction mappings in the theory of dynamic programming,
* SIAM Review*, 9, 165-177, 1968.

Denardo, E.V. and Fox, B.L., Shortest-route methods: 1. reaching, pruning,
and buckets, * Operations Research*, 27, 161-186, 1979a.

Denardo, E.V. and Fox, B.L., Shortest-route methods: 2. group knapsacks,
expanded networks, and branch-and-bound, * Operations Research*, 27,
548-566, 1979b.

Denardo, E.V. and Mitten, L.G., Elements of sequential decision processes,
* Journal of Industrial Engineering*, 18, 106-112, 1967.

Dianicch, D.F. and Gupta, J.N.D., Polynomial approximation technique for
dynamic optimization problems, * Computers and Operations Research*,
13(4), 437-442, 1986.

Dohrmann, C.R., and Busby, H.R., Algorithms for smoothing noisy
data with spline functions and smoothing parameter selection, * VI
International Congress on Experimental Mechanics*, 843-849,
Portland Oregon, 1988.

Dohrmann, C.R., and Busby, H.R., Spline function smoothing and
differentiation of noisy data on a rectangular grid, * 1990 SEM
Spring Conference on Experimental Mechanics*, 76-83,
Albuquerque, New Mexico, 1990.

Dohrmann, C.R., Trujillo, D.M., and Busby, H.R., Smoothing noisy
data using dynamic programming and generalized cross-validation,
*ASME Journal of Biomechanical Engineering*, 110, 37-41, 1988.

Dolcetta, I.C., On a discrete approximation of the Hamilton-Jacobi equation
of dynamic programming, * Applied Mathematics and Optimization*, 10,
367-377, 1983.

Dreyfus, S.E., An appraisal of some shortest-path algorithms, * Operations
Research*, 17, 395-412, 1969.

Dreyfus, S.E. and Law, A.M., * The Art of Dynamic Programming*, Academic
Press, New York, 1977.

Duff, W.S., Minimum cost solar thermal electric power systems: a dynamic
programming based approach, * Engineering Optimization*, 2, 83-95, 1976.

Elmaghraby, S.E., The concept of "state" in discrete dynamic programming,
* Journal of Mathematical Analysis and Applications*, 29, 523-553, 1970.

Elmaghraby, S.E., Comments on a DP model for the optimal inspection
strategy, * IIE Transactions*, 18(1), 104-108, 1986.

Epperson, J.E., Dynamic programming estate transfer model --- the closely
held farm business, * Computers and Operations Research*, 8(4), 347-353,
1981.

Erikson, R.E., and Luss, H., Optimal sizing of records used to store
messages of various lengths, * Management Science*, 26(8), 1980.

Erlenkotter, D., Sequencing expansion projects, * Operations Research*,
21, 542- 553, 1973.

Esogbue, A.O. and Lee, C.Y., Optimal design of large complex conveyance
systems via nonserial dynamic programming, pp.234-258 in Esogbue, A.O.
(ed.), * Dynamic Programming for Optimal Water Resources Systems Analysis*
, Prentice Hall, Englewwod Cliffs, NJ, 1989.

Esogbue, A.O. and Marks, B.R., Non-serial dynamic programming --- a survey,
* Operations Research Quarterly*, 25, 253-265, 1974.

Esogbue, A.O. and Marks, B.R., Dynamic programming models of the nonserial
critical path-cost problem, * Management Science*, 24, 200-209, 1977.

Esogbue, A.O. and Warsi, N.A., A high-level computing algorithm for
diverging and converging branch nonserial dynamic programming systems, *
Computers and Mathematics with Applications*, 12A(6), 719-732, 1986.

Evans, G.W., and Morin, T.L., Hybrid dynamic programming/branch and bound
strategies for electric power generation planning, * IIE Transactions*,
18(2), 138-147, 1986.

Feldman, R.M., Deuermeyer, B.L. and Curry, G.L., A dynamic programming
optimization procedure for a two-product biomass-to-methane conversion
system, * Journal of Mathematical Analysis and Applications*, 125,
203-212, 1987.

Ferreira, J.A.S. and Vidal, R.V.V., Optimization of a pump-pipe system by
dynamic programming, * Engineering Optimization*, 7, 241-251, 1984.

Fleischer, I. and Kooharian, A., Optimization and recursion, * Journal of
the Society of Industrial and Applied Mathematics*, 12(1), 186-188,
1964.

Flynn, J., On optimality criteria for dynamic programs with long finite
horizons, * Journal of Mathematical Analysis and Applications*, 76,
202-208, 1980.

Florian, M., Lenstra, J.K., and Kan, R., Deterministic production planning
algorithms and complexity, * Management Science*, 26(7), 669-679, 1980.

Fond, S., Optimal feedback control policies for stochastic-parameter
systems, * Journal of Optimization Theory and Applications*, 30(3),
501-512, 1980.

Fontane, D.G. and Labadie, J.W., Optimal control reservoir discharge quality
through selective withdrawal, * Water Resources Research*, 17(6),
1596-1604, 1981.

Fox, B.L., Finite-state approximations to denumerable-state dynamic
programs, * Journal of Mathematical Analysis and Applications*, 34,
665-670, 1971.

Fox, B.L., Discretizing dynamic programs, * Journal of Mathematical
Analysis and Applications*,11, 228-234, 1973.

Furukawa, N., Characterization of optimal policies in vector-valued
Markovian decision processes, * Mathematics of Operations Research*, 5,
271-279, 1980.

Gal, S., Optimal management of a multireservoir water supply system, *
Water Resources Research*, 15, 737-749, 1979.

Gerchak, Y. and Henig, M., The basketball shootout: strategy and winning
probabilities, * Operations Research Letters*, 5(3), 241-244, 1986.

Gero, J.S., Architectural optimization --- a review, * Engineering
Optimization*, 1, 189-199, 1975.

Gero, J.S., Sheehan, P.J. and Becker J.M., Building design using feedforward
nonserial dynamic programming, * Engineering Optimization*, 3, 183-192,
1978.

Gero, J.S. and Bradford, A.D., A dynamic programming approach to the optimum
lighting problem, * Engineering Optimization*, 3, 71-82, 1978.

Gero, J.S. and Kaneshalingam, K., A method for the optimum design of
tradition al formwork, * Engineering Optimization*, 3, 249-251, 1978.

Gilmore, P.C. and Gomory, R.E., The theory and computation of knapsack
functions, * Operations Research*, 14, 1045-1074, 1966.

Goldstein, T., Ladany, S.P., and Mehrez, A., A discounted machine
replacement model with an expected future technological breakthrough, *
Naval Research Logistics*, 35, 209-220, 1988.

Greenberg, H., An algorithm for the periodic solutions in the knapsack
problem, * Journal of Mathematical Analysis and Applications*, 111,
327-331, 1985.

Greenberg, H., On equivalent knapsack problems, * Discrete Applied
Mathematics*, 14, 263-268, 1986.

Grossman, D., and Marks, D.H., Capacity expansion for water resource
facility: a control theoretic algorithm for nonstationary uncertain demands,
* Advances in Water Resources*, 1(1), 31-40, 1977.

Gunasekaran, S. and Shove, G.C., Dynamic programming optimization of total
airflow requirement for low temperature maize (corn) drying, * Journal of
Agricultural Engineering and Research*, 34(1), 41-51, 1986.

Gunter, S. and Swanson, L., Semi-Markov dynamic programming approach to
competitive bidding with state space reduction considerations, * European
Journal of Operational Research*, 32, 435-447, 1986.

Hardwick, J. and Stout, Q.F., Bandit strategies for ethical sequential
allocation, * Computing Science and Statistics*, 23, 421-424, 1991.

Hardwick, J. and Stout, Q.F., Optimal allocation for estimating the product of
two means, * Computing Science and Statistics*, 24, 592-596, 1992.

Hardwick, J. and Stout, Q.F., Optimal adaptive equal allocation rules,
* Computing Science and Statistics*, 24, 597-601, 1992.

Hardwick, J. and Stout, Q.F., Exact computational analyses for adaptive designs,
in * Adaptive Designs*, N. Flournoy and W.F. Rosenberger, eds., Institute
of Math. Stat. Lecture Notes --- Monograph Series Vol. 25, 223-237, 1995.

Harley, M.J. and Chidley, T.R.E., Policy iteration dynamic programming
applied to reservoir control, * Engineering Optimization*, 2, 161-171,
1976.

Harley, M.J. and Chidley, T.R.E., Deterministic dynamic programming for long
term reservoir operating policies, * Engineering Optimization*, 3, 63-70,
1978.

Hartley, R., Laercombe, A.C., and Thomas, L.C., Computational comparison of
policy iteration algorithms for discounted Markov decision processes, *
Computers and Operations Research*, 13, 411-420, 1986.

Held, M., and Karp, R.M., A dynamic programming approach to sequencing
problems, * Journal of the Society of Industrial and Applied Mathematics*
, 10, 196-210, 1962.

Held, M., Karp, R.M. and Shareshian, R., Assembly-line balancing dynamic
programming with precedence constraints, * Operations Research*, 11,
442-459, 1963.

Helman, P., The principle of optimality in the design of efficient
algorithms, * Journal of Mathematical Analysis and Applications*, 119,
97-127, 1986.

Helman, P., A common schema for dynamic programming and branch and bound
algorithms, * Journal of the Association for Computing Machinery*, 36(1),
97-128, 1989.

Helman, P. and Rosenthal, A., A comprehensive model of dynamic programming,
* SIAM journal of Algebraic Discrete Methods*, 6, 319-334, 1985.

Henig, M.I., Vector-valued dynamic programming, * SIAM Journal of Control
and Optimization*, 21, 490-499, 1983.

Henig, M.I., The shortest path problem with two objective functions, *
European Journal of Operational Research*, 25, 281-291, 1986.

Henig, M.I., Extensions of the dynamic programming method in the
deterministic and stochastic assembly-line balancing problems, *
Computers and Operations Research*, 13, 443-449, 1986.

Henig, M.I., The principle of optimality in dynamic programming with returns
in partially ordered sets, * Mathematics of Operations Research*, 10(3),
462-470, 1987.

Henig, M.I., Risk criteria in a stochastic knapsack problem, * Operations
Research*, 38(5), 820-825, 1990.

Henig, M. and Gerchak, Y., The structure of periodic review policies in the
presence of random yield, * Operations Research*, 38(4), 634-643, 1990.

Hernandez-Lerma, O., Finite-state approximations for denumerable multi
dimensional state discounted Markov decision processes, * Journal of
Mathematical Analysis and Applications*, 113, 382-389, 1986.

Hill, T.P. and Van der Wal, J., Monotonically improving limit-optimal
strategies in finite-state decision processes, * Mathematics of
Operations Research*, 12(3), 463-473, 1987.

Hinxman, A.I., The trim-loss and assortment problems: a survey, * European
Journal of Operational Research*, 5, 8-18, 1980.

Hirschberg, D.S. and Larmore, L.L., The least weight subsequence problem,
* SIAM Journal of Computing*, 16(4), 628-638, 1987.

Ho, J.k., OPTIMACROS: Optimization with spreadsheet macros, * Operations
Research Letters*, 6(3), 99-103, 1987.

Howson, H.R. and Sancho, N.G.F., A new algorithm for the solution of
multistate dynamic programming problems, * Mathematical Programming*, 8,
104-116, 1975.

Hussein M.L. and Abosinna M.A., A Fuzzy Dynamic Approach to the Multicriterion
Resource Allocation Problem, * Fuzzy Sets & Systems*, 69(2), 115-124,
1995.

Ibaraki, T., Representation theorems for equivalent optimization problems,
* Information and Control*, 21, 397-435, 1972.

Ibaraki, T., Solvable classes of discrete dynamic programming, * Journal
of Mathematical Analysis and Applications*, 43, 642-693, 1973.

Ibaraki, T., Classes of discrete optimization problems and their decision
problems, * Journal of Computer and System Sciences*, 8, 84-116, 1974.

Ibaraki, T., Minimal representations of some classes of dynamic programming,
* Information and Control*, 27, 289-328, 1975.

Ibaraki, T. Branch and bound procedure and state-space representation of
combinatorial optimization problems, * Information and Control*, 36(1),
1-27, 1978.

Ikem, F.M. and Reisman, A.M., An approach to planning for physician
requirements in developing countries using dynamic programming, *
Operations Research*, 38(4), 607-618, 1990.

Iwaki, H., Kijima, M., and Yoshida, T., American put options with a finite
set of exercisable time epochs, * Mathematical & Computer Modelling*,
22(10-12), 89-97, 1995.

Iwamoto, S., Reverse function, reverse program, and reverse theorem in
mathematical programming, * Journal of Mathematical Analysis and
Applications*, 95, 1-19, 1983.

Iwamoto, S., Inverse functional equations for Bellman's allocation process,
* Bulletin of Informatics and Cybernetics*, 20, 57-68, 1983.

Iwamoto, S., Continuous dynamic programming approach to inequalities, II,
* Journal of Mathematical Analysis and Applications*, 118, 279-286, 1986.

Jensen, R.E., A dynamic programming algorithm for cluster analysis, *
Operations Research Society of America*, 17, 1034-1057, 1969.

Jensen, P.A., Modeling with microcomputers for operations research,
* Computers and Operations Research*, 13, 359-366, 1986.

Jeroslow, R.G. and Wang, J., Dynamic programming, integral polyhedra and
Horn clause knowledge bases, * ORSA Journal on Computing*, 1(1), 7-19,
1989.

Jones, D.T., Miller, R.T., and Thornton, J.M., Successful protein fold
recognition by optimal sequence threading validated by rigorous blind
testing, * Proteins*, 23(3), 387-397, 1995.

Jones, L., Willis, R. and W.W-G. Yeh, Optimal control of nonlinear
groundwater hydraulics using differential dynamic programming, * Water
Resources Research*, 23(11), 2097-2106, 1987.

Karlin, S., The structure of dynamic programming models, * Naval Research
Logistics Quarterly*, 2, 285-294, 1955.

Karp, R.M., Dynamic programming meets the principle of inclusion and
exclusion, * Operations Research Letters*, 1, 49-51, 1982.

Karp, R.M. and Held, M., Finite-state processes and dynamic programming,
* SIAM*, * Journal of Applied Mathematics*, 15, 693-718, 1967.

Kashyap, R.L., Optimization of stochastic finite state systems, * IEEE
Transactions on Automatic Control*, 11, 685-692, 1966.

Katehakis, M.N. and Veinott, A.F., The multi-armed bandit problem:
decomposition and computation, * Mathematics of Operations Research*,
12(2), 262-268, 1987.

Kawai, H. and Katoh, N., Variance constrained Markov decision process, *
Journal of the Operations Research Society of Japan*, 30(1), 88-100,
1987.

Kim, S.H. and Jeong, B.H., A partially observable Markov decision process
with lagged information, * Journal of the Operational Research Society*,
38(5), 439-446, 1987.

Kim, S.K. and Yeh, W.W-G., A heuristic solution procedure for expansion
sequencing problems, * Water Resources Research*, 22(8), 1197-1206, 1986.

Kimeldorf, G. and Smith, F.H., Binomial searching for a random number of
multinomially hidden objects, * Management Science*, 25(11), 1115-1126,
1979.

Klein Haneveld, W.K., On the behavior of the optimal value operator of
dynamic programming, * Mathematics of Operations Research*, 5(2),
308-320, 1980.

Kornbluth, J.S.H., Multiple objective dynamic programming with forward
filter ing, * Computers and Operations Research*, 13, 517-524, 1986.

Koyanagi, J., and Kawai, H., An assignment problem for a parallel queueing
system with two heterogeneous servers, * Mathematical & Computer
Modelling*, 22(10-12), 173-181, 1995.

Kreps, D.M., Decision problems with expected utility criteria, I: upper and
lower convergent utility, * Mathematics of Operations Research*, 2,
45-53, 1977.

Kreps, D.M., Decision problems with expected utility criteria, II:
stationarity, * Mathematics of Operations Research*, 2, 266-274, 1977.

Kreimer, J., Golenko-Ginsburg, D., and Mehrez, A., Allocation of control
points in stochastic dynamic programming models, * Journal of the
Operational Research Society*, 39(9), 847-853, 1988.

Krzystofowicz, R., Optimal water supply planning based on seasonal
forecasts, * Water Resources Research*, 22(3), 313-321, 1986.

Kucia, A. and Nowak, A., On \epsilon -optimal selectors and their
application in discounted dynamic programming, * Journal of Optimization
Theory and Applications*, 54(2), 289-302, 1987.

Ladany, S.P., A dynamic model for optimal segmentation of walls built on
non-linear slopes, * Engineering Optimization*, 5, 19-26, 1980.

Lageweg, B.J., Lenstra, J.K. and Stougie, L., Stochastic integer programming
by dynamic programming, * Statistica Neerlandica*, 39(2), 97-113, 1985.

Lamond, B.F., Monroe, S.L. and Sobel, M.J., A Reservoir Hydroelectric
System - Exactly and Approximately Optimal Policies, * European Journal of
Operational Research * 81(3), 535-542, 1995.

Langen, H.J., Convergence of dynamic programming models, * Mathematics of
Operations Research*, 6, 493-511, 1981.

Larson, R.E., A survey of dynamic programming computational procedures, *
IEEE Transactions on Automatic Control*, 767-774, 1967.

Larson, R.E. and Korsak, A.J., A dynamic programming successive approxim
ations technique with convergence proofs, * Automatica*, 6, 245-252, 1970.

Larson, R.E., and Peschon, J., A dynamic programming approach to trajectory
estimation, * IEEE Transactions on Automatic Control*, 537-540, 1966.

Lee, C.Y. and Esogbue, A.O., Optimal procedures for dynamic programs with
complex loop structure, * Journal of Mathematical Analysis and
Applications*, 119, 300-339, 1986.

Lehman, R.S., Dynamic programming and Gaussian elimination, * Journal of
Mathematical Analysis and Applications*, 15, 499-501, 1962.

Lembersky, M.R.and Chi, U.H., Weyerhaeuser decision simulator improves
timber profits, * Interfaces*, 16, 6-15, 1986.

Lew, A., Richard Bellman's contributions to computer science, * Journal
of Mathematical Analysis and Applications*, 119, 90-96, 1986.

Li, D. and Haimes, Y.Y., New approach for nonseparable dynamic programing
problems, * Journal of Optimization Theory and Applications*, 64(2), 1990.

Lin, E.Y.H. and Bricker, D.L., Implementing the recursive APL code for
dynamic programming, * APL Quote Quad*, 20(4), 239-250, 1990.

Lindsay, G.F. and Bishop, A.B., Allocation of screening inspection effort
--- a dynamic programming approach, * Management Science*, 10(2),
342-352, 1964.

Livingston, M. and Stout, Q.F., Constant time computation of minimum dominating
sets, * Congresses Numerantium*, 105, 116-128, 1994.

Love, C.E., Purchase/replacement rules for decaying service facilities,
* Computers and Operations Research*, 4, 111-118, 1977.

Love, C.E., Optimal equipment transfer pricing in service systems, *
Journal of the Operational Research Society*, 31, 657-666, 1980.

Lovejoy, W.S., Ordered solutions for dynamic programs, * Mathematics of
Operations Research*, 12(2), 269-276, 1987.

Lu, F.C., and Hsu, Y.Y, Reactive power voltage control in a distribution
substation using dynamic programming, *IEE Proceedings. Generation,
Transmission & Distribution*, 142(6), 639-645, 1995.

Lyra, C., and Ferreira, L.R.M., A multiobjective approach to the short-term
scheduling of a hydroelectric power system, *IEEE Transactions on Power
Systems*, 10(4), 1750-1755, 1995.

Maliphant S.A. and Smith D.K., Mini-Risk: strategies for a simplified board
games, * Journal of the Operational Research Society*, 41(1), pp. 9-16,
1990.

Maly, D.K., and Kwan, K.S., Optimal battery energy storage system (BESS)
charge scheduling with dynamic programming, * IEE Proceedings-A-Science
Measurement & Technology*, 142(6), 453-458, 1995.

Martin, R.K., R.L. Rardin, and B.A. Campbell, Polyhedral characterization of
discrete dynamic programming, * Operations Research*, 38(1), 127-138,
1990.

Matanaga, G.B., and Marino, M.A., Irrigation planning 2. Water allocation
for leaching and irrigation purposes, * Water Resources Research*, 15(3),
679-683, 1979.

Mayne, D., A second-order gradient method for determining optimal
trajectories of non-linear discrete-time systems, * International Journal
of Control*, 3, 85-95, 1966.

McGechan, M.B. and Glasbey, C.A., Combine speed strategies in cereal
harvesting. Part 2: adjustment for weather variability, * Journal of
Agricultural Engineering and Research*, 33(1), 13-22, 1986.

McLeod, A.I., The cargo loading or knapsack problem by dynamic programming,
* APL Quote Quad*, 14(1), 21-22, 1983.

Mehlamann, A., An approach to optimal recruitment and transition strategies
for manpower systems using dynamic programming, * Journal of the
Operational Research Society*, 31, 1009-1015, 1980.

Milito, R.A., and Fernandezgaucherand, E., Open-loop routing of N arrivals
to M parallel queues, * IEEE Transactions on Automatic Control*, 40(12),
2108-2114, 1995.

Mitten, L.G., Composition principles for synthesis of optimal multistage
processes, * Operations Research*, 12, 414-424, 1964.

Mitten, L.G., Preference order dynamic programming, * Management Science*
, 21, 43-46, 1974.

Mitten, L.C. and Nemhauser, G.L., Multistage optimization, * Chemical
Engineering Progress*, 59(1), 52-60, 1963.

Mitten, L.C. and Nemhauser, G.L., Optimization of multistage separation
processes by dynamic programming, * The Canadian Journal of Chemical
Engineering*, 41, 187-194, 1963.

Moore, J.C. and Whinston, A.B., A model of decision-making with sequential
information-acquisition Part 1, * Decision Support System*, 2, 285-307,
1986.

Moore, J.C. and Whinston, A.B., A model of decision-making with sequential
information-acquisition Part 2, * Decision Support System*, 2, 47-72,
1987.

Moores, B., Dynamic programming in transormer design, * Journal of the
Operational Research Society*, 37(10), 967-969, 1986.

Morin, T.L., Pathology of a dynamic programming sequencing algorithm, *
Water Resources Research*, 9, 1178-1185, 1973.

Morin, T.L., Solution of some combinatorial optimization problems
encountered in water resources development, * Engineering Optimization*,
1, 155-167, 1975.

Morin, T.L., Computational advances in dynamic programming, pp. 53-90, in
* Dynamic Programming and its Applications*, Puterman, M.L., editor,
Academic Press, New York, 1978.

Morin, T.L., Monotonicity and the principle of optimality, * Journal of
Mathematical Analysis and Applications*, 88, 665-674, 1982.

Morin, T.L. and Esogbue, A.O, The imbedded state space approach to
reducing dimensionality in dynamic programs of higher dimensions, *
Journal of Mathematical Analysis and Applications*, 48, 801-810, 1974.

Morin, T.L. and Marsten, R.E., Branch and bound strategies for dynamic
programming, * Operations Research*, 24, 611-627, 1976.

Murray, D.M. and Yakowitz, S.J., Constrained differential dynamic
programming and its application to multireservoir control, * Water
Resources Research*, 15, 1017-1027, 1979.

Murray, D.M. and Yakowitz, S.J., The application of optimal control
methodology to nonlinear programming problems, * Mathematical Programming*
, 21, 331-347, 1981.

Murray, D.M. and Yakowitz, S.J., Differential dynamic programming and
Newton's method for discrete optimal control problems, * Journal of
Optimization Theory and Applications*, 43, 395-414, 1984.

Nachman, D.C., Optimal stopping with a horizon constraint, * Mathematics
of Operations Research*, 5(1), 126-134, 1980.

Nemhauser, G.L. and Ullman, Z., Discrete dynamic programming and capital
allocation, * Management Science*, 15, 494-505, 1969.
Nicole, D.M., Parallel solution of sparse one-dimensional dynamic
programming problems, * ORSA Journal of Computing*, 2(2), 162-173, 1990.

Nilsson, N.J., * Problem Solving Methods in Artificial Intelligence*,
McGraw-Hill, N.Y., 1971.

Noe, N.H. and Ehrenfeld, S., A Bayesian sequential multi-decision problem,
* Management Science*, 20(3), 274-281, 1973.

Nollau, V., A stochastic decision model with vector-valued reward, *
Optimization*, 16, 733-742, 1985.

Norman, J.M. and White, D.J., A method for approximate solutions to
stochastic dynamic programming problems using expectations, * Operations
Research*, 16, 296-306, 1968.

Norman, J.M., and Shearn, D.C.S., Optimal claiming on vehicle insurance
revisited, * Journal of the Operational Research Society*, 31, 181-186,
1980.

Nwannenna, C.C., A computer model for power system control, * Computers
and Operations Research*, 14(4), 325-340, 1987.

Ohno, K. and Ichiki, K., Computing optimal policies for controlled tandem
queueing systems, * Operations Research*, 35(1), 121-126, 1987.

Olorunniwo, F.O. and Jensen, P.A., Optimal capacity expansion policy for
natural gas transmission network --- a decomposition approach, *
Engineering Optimization*, 6, 13-30, 1982.

Olstad, B., and Manne, F., Efficient partitioning of sequences, * IEEE
Transactions on Computers*, 44(11), 1322-1326, 1995

.
Ozden, M., A new algorithm for multi-dimensional dynamic programming
problems, * Operations Research Letters*, 2, 84-89, 1983.

Ozden, M., A solution procedure for general knapsack problems with a few
constraints, * Computers and Operations Research*, 15(2), 145-155, 1988.

Paul, H., Law, S.S., and Leong, H.K., A method for single facility multiple
products scheduling, * Journal of the Operational Research Society*, 31,
825-832, 1980.

Panossian, H., Richard Bellman and stochastic control systems, *
computers and Mathematics with Applications*, 12A(6), 825-827, 1986.

Papadimitriou, C.H. and Tsitsiklis, J.N., The complexity of Markov decision
processes, * Mathematics of Operations Research*, 12(3), 441-450, 1987.

Parlar, Dynamic programming on an electronic spreadsheet, * Computers and
Industrial Engineering*, 10(3), 203-213, 1986.

Petersen, E.R. and Taylor, A.J., Probabilistic optimization spreadsheets:
PROPS, * Operations Research Letters*, 9, 271-274, 1990.

Pikaz, A. and Dinstein, I.H., Matching of Partially Occluded Planar Curves,
* Pattern Recognition* , 28(2), 199-209, 1995.

Pope, D.N. and Curry, G.L., Computerized analytical solutions in dynamic
programming, * Computers and Industrial Engineering*, 5, 257-270, 1981.

Pope, D.N., Curry, G.L., and Phillips, D.T., Closed form solutions to
nonserial nonconvex quadratic programming problems using dynamic
programming, * Journal of Mathematical Analysis and Applications*, 86,
628-647, 1982.

Porteus, E., An informal look at the principle of optimality, * Manag
ement Science*, 21, 1346-1348, 1975.

Porteus, E., Conditions for characterizing the structure of optimal
strategies in infinite-horizon dynamic programs, * Journal of
Optimization Theory and Applications*, 36, 419-432, 1982.

Potts, C.N. and Van Wassonhove, L.N., Dynamic programming and decomposition
approaches for the single machine total tardiness problem, * European
Journal of Operational Research*, 32, 405-414, 1987.

Prastacos, G.P., Optimal sequential investment decisions under conditions of
uncertainty, * Management Science*, 29, 118-134, 1983.

Presman, E., and Sethi, S., Distribution of bankruptcy time in a consumption
portfolio problem, * Journal of Economic Dynamics & Control*,
20(1-3), 471-477, 1996.

Provencher, B., Structural estimation of the stochastic dynamic decision
problems of resource users - an application to the timber harvest decision,
* Journal of Environmental Economics & Management*, 29(3 Part 1),
321-338, 1195.

Ram, B. and Babu, A.J.G., Reduction of dimensionality in dynamic programming
based solution methods for nonlinear integer programming, * International
Journal for Mathematics and Mathematical Sciences*, 11(4), 811-814, 1988.

Rayward-Smith, V.J., Mckeown, G.P. and Burton, F.W., The general problem
solving algorithm and its implementation, * New Generation Computing*, 6,
41-66, 1988.

Richter, K., Stability of the constant cost dynamic lot size model, *
European Journal of Operational Research*, 31, 61-65, 1987.

Richter, R., Stochastically maximizing the number of successes in a
sequential assignment problem, * Journal of Applied Probability*, 27,
351-364, 1990.

Rink, R.E. and Li, N., Aggregation Disaggregation Method for Optimal Control
of Multizone HVAC Systems, * Energy Conversion & Management* 36(2),
79-86, 1995.

Rom, W.O. and Winter, F.W., New product evaluation using a bayesian dynamic
program, * Journal of the Operational Research Society*, 32, 223-232,
1981.

Roosta, M., On the connectivity of a network, * Journal of Mathematical
Analysis and Applications*, 83, 209-211, 1981.

Roosta, M., Routing through a network with maximum reliability, * Journal
of Mathematical Analysis and Applications*, 88, 341-347, 1982.

Rosenman, M.A. and Gero, J.S., Heuristic nonserial dynamic programming for
large problems, * Engineering Optimization*, 4, 167-178, 1980.

Rosenman, M.A., Bradford, A.D. and Gero, J.S., Postoptimality analysis in
dynamic programming, * Engineering Optimization*, 4, 207-214, 1980.

Rosenman, M.A. and Gero, J.S., Reducing the pareto optimal set in
multicriteria optimization (with applications to Pareto optimal dynamic
programming), * Engineering Optimization*, 8, 189-206, 1985.

Rosenthal, A., Dynamic programming is optimal for certain sequential
decision processes, * Journal of Mathemarical Analysis and Applications*,
73, 134-137, 1980.

Rosenthal, A., Dynamic programming is optimal for nonserial optimization
problems, * SIAM Journal of Computation*, 11, 47-59, 1982.

Ross, S.M., Dynamic programming and gambling models, * Advances in Applied
Probability*, 6, 607-621, 1974.

Rossman, L.A., Reliability constrained dynamic programming and randomized
release rules in reservoir management, * Water Resources Research*,
13(2), 247-255, 1977.

Rothblum, U.G., Karni, R. and Gelfand, E., A dynamic programming formulation
of a production sequencing problem, * Computers and Industrial Engineering
*, 7, 69-75, 1983.

Russell, M.J., Moore, R.K. and Tomlinson, M.J., Dynamic programming and
statistical modelling in automatic speech recognition, * Journal of the
Operational Research Society*, 37, 21-30, 1986.

Sallabergers, C.S. and Deleuterio, G.M.T., Optimal Robotic Path Planning
using Dynamic Programming and Randomization, * Acta Astronautica*,
35(2-3), 143-156, 1995.

Sancho, N.G.F., A multi-objective routing problem, * Engineering
Optimization*, 10, 71-76, 1986.

Sawaki, K., Piecewise linear dynamic programs with applications, * Journal of the Operations Research Society of Japan*, 23(2), 91-109,
1980.

Schal, M., An operator-theoretical treatment of negative dynamic programming, in * Dynamic Programming and its Applications *, Puterman, M.L., Editor, Academic Press, New York, 1978.

Schal, M., On the chance to visit a goal set infinitely often, * Optimization*, 21(4), 585-592, 1990.

Schrage, L. and Baker, K.R., Dynamic programming solutions of sequencing
problems with precedence constraints, * Operations Research*, 26, 444-449, 1978.

Shapiro, J.F., Dynamic programming algorithms for the integer programming
problem -I: the integer programming problem viewed as a knapsack type
problem, * Operations Research*, 16, 103-121, 1968.

Shapiro, J.F., Turnpike theorems for integer programming problems, *
Operations Research*, 18, 432-440, 1970.

Shapiro, J.S. and Wagner, H.M., A finite renewal algorithm for the knapsack
and turnpike models, * Operations Research*, 15, 319-341, 1967.

Shoemaker, C.A., Applications of dynamic programming and other optimization
methods in pest management, * IEEE Transactions on Automatic Control*,
26, 1125-1132, 1981.

Sidrak, Y.L. Model Based Optimisation of Kamyr Digester Operation, *
TAPPI Journal*, 78(3), 93-98, 1995.

Simms, B.W, Lamarre, B.G. and Jardine, A.K.S., Optimal buy, operate and
sell policies for fleet of vehicles, * European Journal of Operational
Research*, 15, 183-195, 1984.

Sniedovich, M., Dynamic programming and the principle of optimality: a
systematic approach, * Advances in Water Resources*, 1(3), 131-139, 1978a.

Sniedovich, M., Dynamic programming and principles of optimality, *
Journal of Mathematical Analysis and Applications*, 65(3), 586-606,
1978b.

Sniedovich, M., Reliability constrained reservoir control problems 1:
methodological issues, * Water Resources Research*, 15(6), 1574-1582,
1979.

Sniedovich, M., A variance constrained reservoir control problem, * Water
Resources Research*, 16(2), 271-274, 1980a.

Sniedovich, M., Preference order stochastic knapsack problems:
methodological issues, * Journal of the Operational Research Society*,
31, 1025-1032, 1980b.

Sniedovich, M., Analysis of a preference order assembly line problem, *
Management Science*, 27(9), 1067-1080, 1981a.

Sniedovich, M., Analysis of a preference order travelling salesman problem,
* Operations Research*, 29(6), 1234-1237, 1981b.

Sniedovich, M., Use of APL in operations research: an interactive dynamic
programming model, * APL Quote Quad*, 12(1), 291-297, 1981c.

Sniedovich, M., A class of variance constrained problems, * Operations
Research*, 31(2), 338-353, 1983.

Sniedovich, M., A new look at Bellman's principle of optimality, *
Journal of Optimization Theory and Applications*, 49(1), 161-176,
1986a.

Sniedovich, M., A class of nonseparable dynamic programming problems, *
Journal of Optimization Theory and Applications*, 52(1), 111-121, 1987.

Sniedovich, M., A multi-objective routing problem revisited, * Engineering
Optimization*, 13, 99-108, 1988.

Sniedovich, M. and Nielsen, P.A., A heuristic solution procedure for a joint
reservoir control capacity expansion problem, * Water Resources Research*
, 19(1), 15-20, 1983.

Sobel, J.M., Ordinal dynamic programming, * Management Science*, 21,
967-975, 1975.

Sobel, J.M., Reservoir management models, * Water Resources Research*,
11, 767-776, 1975.

Soliman, S.A., Christensen, G.S. and Abdel-Halim, M.A., Optimal operation of
multireservoir power system, * Journal of Optimization Theory and
Applications*, 49, 449-461, 1986.

Stanfel, L.E., A recursive Lagrangian method for clustering problems, *
European Journal of Operational Research*, 27, 332-342, 1986.

Steinberg, E. and Parks, M.S., A preference order dynamic program for a
knapsack problem with stochastic reward, * Journal of the Operational
Research Society*, 30(2), 141-147, 1979.

Steudel, H.J., Generating pallet loading patterns: a special case of the two
dimensional cutting stock problem, * Management Science*, 25(10),
997-1004, 1979.

Steudel, H.J. and Ballakur, A., A dynamic programming based heuristic for
machine grouping in manufacturing cell formation, * Computers and
Industrial Engineering*, 12(3), 215-222, 1987.

Streufert, P.A., Biconvergent stochastic dynamnic programming, asymptotic
impatience, and average growth, *Journal of Economic Dynamics &
Control*, 20(1-3), 385-413, 1996.

Striebel, C., Sufficient statistics in the optimum control of stochastic
systems, * Journal of Mathematical Analysis and Applications*, 12,
576-592, 1965.

Sung, C.S. and Chang, S.H., A capacity planning model for a multi-product
facility, * Engineering Optimization*, 10, 263-270, 1987.

Sutherland, W.R.S., Optimality in transient Markov chains and linear
programming, * Mathematical programming*, 18, 1-6, 1980.

Sutherland, W.R.S., Wolkowicz, H., and Zeidan, V., An explicit linear
solution for the quadratic dynamic programming problem, * Journal of
Optimization Theory and Applications*, 58(2), 319-330, 1988.

Szidarovszky, F. and Duckstein,L., Dynamic multiobjective optimization: a
framework with application to regional water and mining management, *
European Journal of Operational Research*, 24, 305-317, 1986.

Szidarovsky, F., Gershon, M., and Bardossy, A., Application of
multiobjective dynamic programming to regional natural resource management,
* Applied Mathematics and Computation*, 24, 281-301, 1987.

Tandy, D.F., Trujillo, D.M., and Busby, H.R, Solution of inverse
heat conduction problems using an eigenvalue reduction
technique, *Numerical Heat Transfer *, 10, 597-617, 1986.

Tang, J., and Luh, P.B., Hydrothermal scheduling via extended differential dynamic programming and mixed coordination, IEEE Transactions on Power Systems, 10(4), 2021-2028, 1995.

Tarvainen, K., An elimination condition to check the validity of the
principle of optimality, *Computers & Operations Research*, 23(2),
183-192, 1996.

Tauxe, G.W., Inman, R.R. and Mades, D.M., Multiobjective dynamic
programming: a classic problem redressed, * Water Resources Research*,
15, 1398-1402, 1979.

Tauxe, G.W., Inman, R.R. and Mades, D.M., Multiobjective dynamic programm
ing with applications to a reservoir, * Water Resources Research*, 15,
1403- 1408, 1979.

Terry, L.A. Pereira, M.V.F., Araripe Neto, T.A., Silva, L.F.C.A. and Sales,
P.R.H., Coordinating the energy generation of the Brazilian national
hydrothermal electrical generating system, * Interfaces*, 16, 16-38, 1986.

Thiriet, L., and Deledicq, A., Applications of suboptimality in dynamic
programming, * Industrial and Engineering Chemistry*, 60(2), 23-28, 1968.

Thomas, M.E., A survey of the state of the art in dynamic programming, *
AIIE Transactions*, 8, 56-69, 1976.

Thompson, M.G. and Granum, E., Dynamic programming inference of Markov
networks from finite sets of sample strings, * IEEE Transactions on
Pattern Analysis and Machine Intelligence*, 8(4), 491-501, 1986.

Trezos, T. and Yeh, W.W-G., Use of stochastic dynamic programming for reservoir management, 23(6), 983-996, 1987.

Trujillo, D.M., Application of dynamic programming to the general
inverse problem", * International Journal for Numerical Methods in
Engineering*, 12, 613-624, 1978.

Trujillo, D.M., and Busby, H.R., A mathematical method for the
measurement of bone motion with skin-mounted accelerometers, * ASME
Journal of Biomechanical Engineering*, 112, 229-231, 1990.

Trujillo, D.M., and Busby, H.R., Investigation of a technique for
the differentiation of empirical data, *ASME Joural of Dynamic
Systems, Measurement , and Control*, 105, 200-203, 1983.

Trujillo, D.M., and Busby, H.R., Optimal regularization of the
inverse heat-conduction problem, * AIAA Journal Thermophysics and Heat
Transfer*, 3(4), 423-427, 1989.

Trujillo, D.M., and Busby, H.R., Optimal regularization of the
inverse heat-conduction problem using the L-curve, * International
Journal for Numerical Methods in Heat & Fluid Flow*, 4, 447-452, 1994.

Trujillo, D.M., and Carter, A.L., A new approach to the integration
of accelerometer data, * Earthquake Engineering and Structural Dynamics*,
10, 529-535, 1982.

Trujillo, D.M., and Wallis, R., Determination of heat transfer from
components during quenching", *Industrial Heating*, 22-24, July
1989.

Turgeon, A., Optimal operation of multireservoir power systems with
stochastic inflows, * Water Resources Research*, 16, 275-283, 1980.

Van Dawen, R., Finite state dynamic programming with the total reward
criterion, * Zeitschrift fur Operations Research*, 30, 1-14, 1986.

Van der Vet, R.P., On the Bellman principle for decision problems with
random decision policies, * Journal of Engineering Mathematics*, 10(2),
107-114, 1976.

Veinott, A.F. Jr., On finding optimal policies in discrete dynamic
programming with no discounting, * Annals of Mathematical Statistics*,
37, 1284-1295, 1966.

Venezia, I., The optimal frequency of information purchases, * European
Journal of Operational Research*, 4, 118-123, 1980.

Verdu, S. and Poor, H.V., Abstract dynamic programming models under
commutativity conditions, * SIAM Journal of Control and Optimization*,
25(4), 990-1006, 1987.

Vidal, R.V.V., A global maximum principle for discrete-time control
problems, * Engineering Optimization*, 10, 77-84, 1986.

Vidal, R.V.V., On the sufficiency of the linear maximum principle for
discrete-time control problems, * Journal of Optimization Theory and
Applications*, 54(3), 583-589, 1987.

Villarreal, B. and Karwan, M.H., Multicriteria dynamic programming with an
application to the integer case, * Journal of Optimization Theory and
Applications*, 38, 43-69, 1982.

Viswanathan, B. Aggarwal, V. and Nair, K.P.K., Multiple criteria Markov
decision processes, * TIMS Studies in the Management Sciences*, 6,
263-272, 1977.

Wald, A., * Sequential Analysis*, Wiley, New York, 1947.

Wakuta, K., The Bellman's Principle of Optimality in the discounted dynamic
programming, * Journal of Mathematical Analysis and Applications*, 125,
213-217, 1987.

Walters, G.A., The design of the optimal layout for a sewer network, *
Engineering Optimization*, 9, 37-50, 1985.

Walters, G.A., Generating the optimum tree network with nonlinear flow
dependent arc costs, * Engineering Optimization*, 9, 121-126, 1985.

Walters, .A., and Templeman, A.B., Non-optimal dynamic programming
algorithms in the design of minimum cost drainage systems, * Engineering
Optimization*, 4, 139-148, 1979.

Wanatabe, S., Saito, T., Cheong, C.K., and Aizawa, K., An algorithm for
making a correspondence of zero-crossing points in a wavelet tranform domain
with a second-order derivative property, * Electronics & Communications in
Japan, Part iii: Fundamental Electronic Science*, 78(6), 103-116,
1995.

Wang, C.L., Functional equation approach to inequalities III, * Journal of
Mathematical Analysis and Applications*, 80, 31-35, 1981.

Wang, C.L., The principle and models of dynamic programming, * Journal of
Mathematical Analysis and Applications*, 130, 287-308, 1986.

Wang, C.L., The principle and models of dynamic programming, II, *
Journal of Mathematical Analysis and Applications*, 135, 268-283, 1988.

Wang, C.L., The principle and models of dynamic programming, III, *
Journal of Mathematical Analysis and Applications*, 135, 284-296, 1988.

Wang, D. and Adams, B.J., Optimization of real-time reservoir operations
with Markov decision processes, * Water Resources Research*, 22(3),
345-352, 1986.

Warwick, J. and Phelps, B., An application of dynamic programming to pattern
recognition, * Journal of the Operational Research Society*, 37, 35-40,
1986.

White, C.C.,III and Scherer, W.T., Reward revision and the average Markov
decision Process, * OR Spectrum*, 9, 203-211, 1987.

White, D.J., Dynamic programming, Markov chains, and the method of
successive approximations, * Journal of Mathematical Analysis and
Applications*, 6, 373-376, 1963.

White, D.J., Dynamic programming and probabilistic constraints, *
Operations Research*, 22, 654-664, 1974.

White, D.J., Multi-objective interactive programming, * Journal of the
Operational Research Society*, 31, 517-523, 1980.

White, D.J., Multi-objective infinite-horizon discounted Markov decision
processes, * Journal of Mathematical Analysis and Applications*, 89,
639-647, 1982.

White, D.J., The set of efficient solutions for multiple objective shortest
path problems, * Computers and Operations Research*, 9, 101-107, 1982.

White, D.J., The determination of approximately optimal policies in Markov
decision processes by the use of bounds, * Journal of the Operational
Research Society*, 33, 253-259, 1982.

White, D.J., Monotone value iteration for discounted finite Markov decision
processes, * Journal of Mathematical Analysis and Applications*, 109,
311-324, 1985.

White, D.J., Approximating Markov decision processes using expected state
transitions, * Journal of Mathemarical Analysis and Applications*, 107,
167-181, 1985.

White, D.J., Real applications of Markov decision processes, * Interfaces*
, 15, 73- 83, 1985.

White, D.J., Mean variance, and probabilistic criteria in finite Markov
decision processes: a survey, * Journal of Optimization Theory and
Applications*, 56(1), 1-29, 1988.

White, D.J. and Kim, K., Two solution procedures for solving vector
criterion Markov decision processes, * Large Scale Systems*, 1, 129-140,
1980.

Wilson, A.J., Britch, A.L. and Templeman, A.B., The optimal design of
drainage systems, * Engineering Optimization*, 1, 111-123, 1974.

Winston, W., A stochastic game model of a weapons development competition,
* SIAM Journal of Control and Optimization*, 16(3), 411-419, 1978.

Womer, N.K., Gulledge T.R., Jr., and Tarimcilar, M.M., A comparison of
several dynamic programming models of the made-to-order production
situation, * Operations Research Letters*, 5, 87-92, 1986.

Wong, P.J. and Luenberger, D.G., Reducing the memory requirements of dynamic
programming, * Operations Research*, 16, 1115-1125, 1968.

Wong, P.J., A new decomposition procedure for dynamic programming, *
Operations Research*, 18, 119-131, 1970.

Wong, P.J., An approach to reducing the computing time for dynamic
programming, * Operations Research*, 18, 181-185, 1970.

Wu, C.M., Liu, P. and Chang, W.C., Unconstrained-Endpoint Dynamic
Space-Warping Algorithm with Experiments in Binary English Character
Images, * International Journal of Electronics*, 78(1), 55-66, 1995.

Yakowitz, S.J., Dynamic programming applications in water resources, *
Water Resources Research*, 18, 673-696, 1982.

Yakowitz, S.J., Convergence rate analysis of the state increment dynamic
programming method, * Automatica*, 19, 53-60, 1983.

Yakowitz, S.J., The stagewise Khun-Tucker condition and differential dynamic
programming, * IEEE Transactions on Automatic Control*, 31(1), 25-30,
1986.

Yakowitz, S.J. and Rutherford, B., Computational aspects of discrete-time
optimal control, * Applied Mathematics and computation*, 15, 29-45, 1984.

Yao, F.F., Speed-up in dynamic programming, * SIAM Journal of Al
gorithms and Discrete Methods*, 3, 532-540, 1982.

Yasuda, M., Explicit optimal value for Dynkins stopping game, *
Mathematical & Computer Modelling*, 22(10-12), 313-324, 1995.

Zufryden, F.S., A dynamic programming approach for product selection and
supermarket shelf-space allocation, * Journal of the Operational Research
Society*, 37, 413-422, 1986.

Zufryden, F.S., New computational results with a dynamic programming
approach for product selection and supermarket shelf-space allocation, *
Journal of the Operations Research Society*, 38(2), 201-203, 1987.

Zuo, Z.Q. and Wu, C.P., Successive approximation technique for a class of
large scale NLP problems and its application to dynamic programming, *
Journal of Optimization Theory and Applications*, 62(3), 515-527, 1989.

Crawl back to front page

Crawl back to DP Bibliography

Crawl back to WORMS