Generalizing Global Constraints Based on Network Flows

DOI10.1007/978-3-540-89812-2_9MaRDI QIDQ5302729zbMATH OpenOpenAlexFDO

Authors Igor Razgon, Barry O'Sullivan, Gregory M. Provan

Publication date 13 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89812-2_9

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2084706
• Global Constraints: A Survey
• scientific article; zbMATH DE number 2159467
• Principles and Practice of Constraint Programming – CP 2004
• Global constraint catalogue: past, present and future

Cites work

• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Combination of Among and Cardinality Constraints
• Introducing global constraints in CHIP
• Introduction to algorithms
• Modelling and solving employee timetabling problems
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(9)

• Dynamic global constraints in backtracking based environments
• Three generalizations of the FOCUS constraint
• The complexity of reasoning with global constraints
• Boosting set constraint propagation for network design
• scientific article; zbMATH DE number 2080298 (Why is no real title available?)
• scientific article; zbMATH DE number 2084706 (Why is no real title available?)
• scientific article; zbMATH DE number 2159467 (Why is no real title available?)
• scientific article; zbMATH DE number 2099099 (Why is no real title available?)
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Generalizing Global Constraints Based on Network Flows

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