Graph Invariants as Necessary Conditions for Global Constraints

DOI10.1007/11564751_10zbMATH Open1153.68446OpenAlexW1574737102MaRDI QIDQ3524167FDOQ3524167

Authors: Nicolas Beldiceanu, Mats Carlsson, Charlotte Truchet, Jean-Xavier Rampon 

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_10

Recommendations

• Global constraint catalogue: past, present and future
• scientific article; zbMATH DE number 2080298
• Propagation rules for graph partitioning constraints
• Bounds of Graph Characteristics
• Bounds of graph parameters for global constraints

Mathematics Subject Classification ID

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

Cited In (10)

• Invariants for time-series constraints
• Global constraint catalogue: past, present and future
• A Graphical Theorem of the Alternative for UTVPI Constraints
• Models for global constraint applications
• Integer sequence discovery from small graphs
• Bounds of Graph Characteristics
• Constraint programming-based column generation
• Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Title not available (Why is that?)

Uses Software

• SICStus

This page was built for publication: Graph Invariants as Necessary Conditions for Global Constraints

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