Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint
From MaRDI portal
Recommendations
- Fast bound consistency for the global cardinality constraint
- An \(O(n\log n)\) bound consistency algorithm for the conjunction of an \textit{alldifferent} and an inequality between a sum of variables and a constant, and its generalization
- Complete bound consistency for the global cardinality constraint
- Generalised arc consistency for the AllDifferent constraint: an empirical survey
- The \textsc{AllDifferent} constraint with precedences
Cited in
(16)- A tighter bound for FFd algorithm
- Constraint programming and operations research
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- A parallel algorithm for GAC filtering of the Alldifferent constraint
- Graph matching problems and the NP-hardness of sortedness constraints
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
- Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
- An \(O(n\log n)\) bound consistency algorithm for the conjunction of an \textit{alldifferent} and an inequality between a sum of variables and a constant, and its generalization
- Bounds of graph parameters for global constraints
- Complete bound consistency for the global cardinality constraint
- Filtering algorithms for the multiset ordering constraint
- Computing leximin-optimal solutions in constraint networks
- Multiconsistency and robustness with global constraints
- Global constraint catalogue: past, present and future
- Simultaneous matchings: Hardness and approximation
This page was built for publication: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473034)
