A Note on a Two-dimensional Dynamic Programming Problem

DOI10.1057/jors.1975.66zbMath0301.90048OpenAlexW1978190435MaRDI QIDQ4055401

E. Page

Publication date: 1975

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1975.66

Mathematics Subject Classification ID

Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items

Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, A dynamic programming based heuristic for industrial buying of cardboard, The trim-loss and assortment problems: A survey, A note on ``Reducing the number of binary variables in cutting stock problems, Solution to the assortment problem via the genetic algorithm, Unnamed Item, A fast algorithm for assortment optimization problems, A comparison of solution methods for the assortment problem, A mixed-integer programming model for a class of assortment problems, An algorithm for the two-dimensional assortment problem, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, An approximately global optimization method for assortment problems