Affordable Access

Improved lower bounds for solving the minimal open stacks problem

School of Computer Science, University of St. Andrews
Publication Date


In this paper we demonstrate the benefit of calculating good lower bounds for the value of , the maximum number of concurrently open stacks, for an optimal solution. We give several theoretical results and illustrate their use when applying a model checking approach to find solutions. The improvement afforded is equally valid when a constraints modelling approach is taken.

There are no comments yet on this publication. Be the first to share your thoughts.