[gecode-users] algorithm used in sequence constraint

[Kish Shen]

Hi,

In the MPG, it is stated that the sequence constraint is implemented 
using the domain consistent algorithm described in the paper by van 
Hoeve and others.

Last year, Helmut Simonis contributed the sequence constraint for 
ECLiPSe, and he used the (also domain consistent) algorithm described in 
the paper by Maher and others in CP 2008. As fat as I can tell from 
checking the two papers, Maher's algorithm was developed after the one 
proposed by van Hoeve, and may be more efficient.

Was the reason for implementing van Hoeve's algorithm in gecode simply 
because it was made before Maher's was published, or is there some other 
reason for picking it?

Thanks and cheers,

Kish

-- 
This e-mail may contain confidential and privileged material for the
sole use of the intended recipient. Any review, use, distribution or
disclosure by others is strictly prohibited. If you are not the intended
recipient (or authorized to receive for the recipient), please contact
the sender by reply e-mail and delete all copies of this message.
Cisco Systems Limited (Company Number: 02558939), is registered in
England and Wales with its registered office at 1 Callaghan Square,
Cardiff, South Glamorgan CF10 5BT.