Filtering algorithms for the multiset ordering constraint
From MaRDI portal
(Redirected from Publication:835808)
Recommendations
Cites work
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- scientific article; zbMATH DE number 2080315 (Why is no real title available?)
- An efficient bounds consistency algorithm for the global cardinality constraint
- Complete bound consistency for the global cardinality constraint
- Computing leximin-optimal solutions in constraint networks
- Consistency in networks of relations
- Design, implementation, and evaluation of the constraint language cc(FD)
- Handbook of constraint programming.
- Integer optimization by local search. A domain-independent approach
- Optimal narrowing of a block of sortings in optimal time
- Principles and Practice of Constraint Programming – CP 2003
- Principles and practice of declarative programming. International conference PPDP '99. Paris, France, September 29--October 1, 1999. Proceedings
- Principles of Constraint Programming
Cited in
(9)- Propagation algorithms for lexicographic ordering constraints
- Computing leximin-optimal solutions in constraint networks
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
- Automated streamliner portfolios for constraint satisfaction problems
- Multiset variable representations and constraint propagation
- Fuzzy multiset finite automata and their languages
- On multiset ordering
- Consistency and propagation with multiset constraints: a formal viewpoint
This page was built for publication: Filtering algorithms for the multiset ordering constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835808)