Pages that link to "Item:Q4055401"

The following pages link to A Note on a Two-dimensional Dynamic Programming Problem (Q4055401):

Displaying 12 items.

• An algorithm for the two-dimensional assortment problem (Q759646) (← links)
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
• A dynamic programming based heuristic for industrial buying of cardboard (Q1111922) (← links)
• The trim-loss and assortment problems: A survey (Q1143942) (← links)
• Solution to the assortment problem via the genetic algorithm (Q1197091) (← links)
• An approximately global optimization method for assortment problems (Q1291783) (← links)
• A mixed-integer programming model for a class of assortment problems (Q1804067) (← links)
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• A comparison of solution methods for the assortment problem (Q3354860) (← links)
• (Q4254361) (← links)
• A fast algorithm for assortment optimization problems (Q5945327) (← links)