作者： H. Simonis
DOI:
关键词: Constraint (information theory) 、 Series (mathematics) 、 Backtracking 、 Permutation 、 Local search (constraint satisfaction) 、 Guided Local Search 、 Group (mathematics) 、 Mathematics 、 Mathematical optimization 、 Simple (abstract algebra)
摘要: In this note we present a CHIP program to solve the all-interval series problem, presented as problem prob007 in CSPLIB. We show that one solution can be easily constructed for any size, or found without backtracking by simple search strategy. then results on finding all solutions sizes 6,8,10 and 12. Two different constraint models advantage of using global constraints solving problem. The was originally difficult stochastic local methods, model allows relatively efficient Problem first [Hoo98], proposed CSPLIB library (http://dream.dai.ed.ac.uk/group/csplib) prob007. It expressed following way: permutation