Dynamic Programming to Minimize the Maximum Number of Open Stacks

@article{Banda2007DynamicPT,
  title={Dynamic Programming to Minimize the Maximum Number of Open Stacks},
  author={M. G. D. L. Banda and Peter James Stuckey},
  journal={INFORMS J. Comput.},
  year={2007},
  volume={19},
  pages={607-617}
}
We give a dynamic-programming solution to the problem of minimizing the maximum number of open stacks. Starting from a call-based dynamic program, we show a number of ways to improve the dynamic-programming search, preprocess the problem to simplify it, and determine lower and upper bounds. We then explore a number of search strategies for reducing the search space. The final dynamic-programming solution is, we believe, highly effective. 
36 Citations
Automating branch-and-bound for dynamic programs
  • 16
  • PDF
Minimizing the Maximum Number of Open Stacks by Customer Search
  • 31
  • PDF
Lock-free parallel dynamic programming
  • 43
  • PDF
THE MINIMIZATION OF OPEN STACKS PROBLEM
  • 2
  • PDF
A breadth-first search applied to the minimization of the open stacks
  • 8
  • Highly Influenced
Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques
  • 3
  • PDF
The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
  • 16
  • Highly Influenced
Descent search approaches applied to the minimization of open stacks
  • 2
Minimization of Open Orders Using Interval Graphs
  • 5
  • PDF
...
1
2
3
4
...

References

SHOWING 1-9 OF 9 REFERENCES
On a pattern sequencing problem to minimize the maximum number of open stacks
  • 69
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
  • 64
  • Highly Influential
  • PDF
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
  • 46
  • Highly Influential
Heuristic and exact methods for the cutting sequencing problem
  • 41
Establishing the optimality of sequencing heuristics for cutting stock problems
  • 47
  • Highly Influential
Improved heuristics for sequencing cutting patterns
  • 43
  • Highly Influential
Heuristics for sequencing cutting patterns
  • 59
  • Highly Influential
Modelling Challenge Constraint modelling challenge
  • Modelling Challenge Constraint modelling challenge
  • 2005
Solving Open Stacks with Dynamic Programming INFORMS Journal on Computing
  • Solving Open Stacks with Dynamic Programming INFORMS Journal on Computing