Bounds of graph parameters for global constraints
From MaRDI portal
(Redirected from Publication:3534209)
Recommendations
Cites work
- A generic arc-consistency algorithm and its specializations
- An Algorithm for a Minimum Cover of a Graph
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- Design, implementation, and evaluation of the constraint language cc(FD)
- Fast bound consistency for the global cardinality constraint
- Filtering Algorithms for the NValue Constraint
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080298 (Why is no real title available?)
- scientific article; zbMATH DE number 2080315 (Why is no real title available?)
- scientific article; zbMATH DE number 2084723 (Why is no real title available?)
- scientific article; zbMATH DE number 2099099 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Networks of constraints: Fundamental properties and applications to picture processing
- On global warming: Flow-based soft global constraints
- Principles and Practice of Constraint Programming – CP 2003
- 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
Cited in
(3)
This page was built for publication: Bounds of graph parameters for global constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534209)