Constraint Logic Programming (CLP) (sometimes known as Constraint Satisfaction) and Integer Programming (IP) are often alternative ways of tackling the same problems. One is sometimes better than the other.
CLP offers MODELLING and sometimes COMPUTATIONAL advantages. In particular CLP offers many predicates which help with and expedite the modelling process. Also CLP formulations are usually more concise. For computation CLP is mathematically far less sophisticated than IP essentially performing complete enumeration over increasingly restricted domains for variables.
Examples will be given of different problems formulated and solved both ways.
Current 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996