We have ourselves a party

• Constraint programming (ILOG Solver) won!

• This managed to schedule the party in 27 mins

  • 1994/5 cpu times

• In general, Constraints not always better than ILP

• In this case, constraints were very tight

• Where constraints looser, often ILP better

Previous slide

Next slide

Back to first slide

View graphic version