Campus Event Calendar
Event Entry
New for: D3
What and Who
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
Sven Thiel
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 13 September 2000
13:30
15 Minutes
46.1
024
Saarbrücken
Abstract
I will introduce the Sortedness and the Alldifferent constraint and
the notion of bound-consistency narrowing.
I will reduce the problem to a matching problem and outline an
algorithm to solve it efficiently.
Contact
Sven Thiel
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Constraint Programming; Narrowing Algorithms