Global constraint catalogue: past, present and future
From MaRDI portal
Publication:879974
DOI10.1007/s10601-006-9010-8zbMath1128.68092OpenAlexW2046653058MaRDI QIDQ879974
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Sophie Demassey
Publication date: 10 May 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-9010-8
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Using finite transducers for describing and synthesising structural time-series constraints ⋮ Progress towards the Holy Grail ⋮ A constraint-based local search backend for MiniZinc ⋮ The power of propagation: when GAC is enough ⋮ Itemset mining: a constraint programming perspective ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ Constraint acquisition ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Local search and constraint programming for the post enrolment-based course timetabling problem ⋮ MDDs are efficient modeling tools: an application to some statistical constraints ⋮ When bounds consistency implies domain consistency for regular counting constraints ⋮ On the usefulness of linear modular arithmetic in constraint programming
Uses Software
Cites Work
- Complete bound consistency for the global cardinality constraint
- Reformulation of global constraints based on constraints checkers
- Persistency in maximum cardinality bipartite matchings
- Introducing global constraints in CHIP
- Tight LP bounds for resource constrained project scheduling
- Optimal narrowing of a block of sortings in optimal time
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- Constraint programming for combinatorial search problems
- The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
- Graph Invariants as Necessary Conditions for Global Constraints
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- Parallel Local Search in Comet
- Automatic Detection of Variable and Value Symmetries
- Bounds of Graph Characteristics
- Acquiring Parameters of Implied Global Constraints
- The tree Constraint
- Filtering Algorithms for the NValue Constraint
- Recent Advances in Constraints
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Algorithms and Computation
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global constraint catalogue: past, present and future
