Open AccessSolving hard sequencing problems via the AtMostSeqCard constraint
Author(s) -
Mohamed Siala,
Christian Artigues,
Emmanuel Hébrard,
MarieJosé Huguet
Publication year - 2014
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - constraint (computer aided design) , cardinality (data modeling) , local consistency , constraint programming , constraint logic programming , sequence (biology) , binary constraint , class (philosophy) , upper and lower bounds , computer science , constraint graph , set (abstract data type) , hybrid algorithm (constraint satisfaction) , mathematics , constraint satisfaction , constraint satisfaction dual problem , mathematical optimization , artificial intelligence , data mining , geometry , mathematical analysis , genetics , biology , probabilistic logic , stochastic programming , programming language