Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

CP
2000
Springer

favoriteEmaildiscussreport

159views Artificial Intelligence» more CP 2000»

Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint

14 years 3 months ago

Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint

Download www.mpi-inf.mpg.de

Kurt Mehlhorn, Sven Thiel

Real-time Traffic

Artificial Intelligence | CP 2000 |

claim paper

Related Content

» A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint

» The AllDifferent Constraint with Precedences

» Propagating Conjunctions of AllDifferent Constraints

» On Generators of Random Quasigroup Problems

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CP
Authors	Kurt Mehlhorn, Sven Thiel

Comments (0)