Improved lower bounds for solving the minimal open stacks problem

Miller, A. (2005) Improved lower bounds for solving the minimal open stacks problem. In: Constraint Modelling Challenge 2005, in Conjunction with The Fifth Workshop on Modelling and Solving Problems with Constraints Held at IJCAI 2005, Edinburgh, Scotland, 31 Jul 2005. School of Computer Science, University of St. Andrews: St. Andrews, UK, pp. 36-43.

Full text not currently available from Enlighten.

Publisher's URL: http://www.cs.st-andrews.ac.uk/~ipg/challenge/ModelChallenge05.pdf

Abstract

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.

Item Type:Book Sections
Status:Published
Glasgow Author(s) Enlighten ID:Miller, Dr Alice
Authors: Miller, A.
College/School:College of Science and Engineering > School of Computing Science
Publisher:School of Computer Science, University of St. Andrews

University Staff: Request a correction | Enlighten Editors: Update this record