A constraint model and a reduction operator for the minimising open stacks problem

Miller, A. , Prosser, P. and Unsworth, C. (2005) A constraint model and a reduction operator for the minimising 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. 44-50.

Full text not currently available from Enlighten.

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

Abstract

We present two constraint models for the Minimising Open Stacks Problem (MOSP). Our first model is based on that reported in, and our second is a refinement and is more space efficient. We also present two reduction operators for the MOSP. One reduction operator is applied as a pre-process to remove elements of the problem that are provably redundant, the second dynamically reduces the problem during search. We also introduce conditional lower bounds, which are lower bounds associated with a partial assignment. Experiments are then performed using the two reduction operators, and our best constraint model using the lower bounds.

Item Type:Book Sections
Status:Published
Glasgow Author(s) Enlighten ID:Unsworth, Dr Chris and Prosser, Dr Patrick and Miller, Dr Alice
Authors: Miller, A., Prosser, P., and Unsworth, C.
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