A Note on a Two-dimensional Dynamic Programming Problem

DOI10.1057/JORS.1975.66MaRDI QIDQ4055401zbMATH OpenOpenAlexFDO

Authors E. Page

Publication date 1975

Published in The 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

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

Cited in

(12)

• A note on ``Reducing the number of binary variables in cutting stock problems
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• A dynamic programming based heuristic for industrial buying of cardboard
• A mixed-integer programming model for a class of assortment problems
• An approximately global optimization method for assortment problems
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
• A comparison of solution methods for the assortment problem
• A fast algorithm for assortment optimization problems
• An algorithm for the two-dimensional assortment problem
• The trim-loss and assortment problems: A survey
• Solution to the assortment problem via the genetic algorithm
• scientific article; zbMATH DE number 1310285 (Why is no real title available?)

This page was built for publication: A Note on a Two-dimensional Dynamic Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055401)