University of Leeds / University of St Andrews / D. G. Bridge / /
IndustryTerm
post-processing step / similar search times / constraint modelling systems / search nodes / scalar products / reduced search / identical search results / search space / search time / improved search / /
Organization
Austrian Academy of Science / University of St Andrews / UK Royal Academy of Engineering/EPSRC Research Fellowship / Golomb Ruler Problem School of Computing Research Report / University of Leeds / Peaceable Army / /
Person
Andrea Rendl / Warwick Harvey / M. Wallace Generalized Constraint / Sam-Haroud Using Directed Acyclic Graphs / Ian Miguel / /
Position
queen / representative for the greater expression / model features / /
Common Subexpression Elimination in Automated Constraint Modelling Ian P. Gent and Ian Miguel and Andrea Rendl1 Abstract. Typically, there are many alternative models of a given problem as a constraint satisfaction probl