Solving hard sequencing problems via the AtMostSeqCard constraint | Zendy

Mohamed Siala | Zendy; Christian Artigues | Zendy; Emmanuel Hébrard | Zendy; MarieJosé Huguet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solving 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research