The increasing Nvalue constraint

DOI10.1007/978-3-642-13520-0_5MaRDI QIDQ3569916zbMATH OpenOpenAlexFDO

Authors Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca, Thierry Petit

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Filtering Algorithms for the NValue Constraint
• Filtering algorithms for the NValue constraint
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• scientific article; zbMATH DE number 2084707
• scientific article; zbMATH DE number 2080326

Cited in

(2)

• Filtering Algorithms for the NValue Constraint
• Filtering algorithms for the NValue constraint

This page was built for publication: The increasing Nvalue constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569916)