References

[1]

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. Programme and papers presented at CPAIOR’01: www.icparc.ic.ac.uk/cpAIOR01/, 2001.

[2]

N. Beldiceanu and E. Contjean. Introducing global constraints in CHIP. Mathematical and Computer Modelling, 12:97–123, 1994. citeseer.nj.nec.com/beldiceanu94introducing.html.

[3]

A. Bockmayr and T. Kasper. Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10(3):287–300, 1998.

[4]

H. H. El Sakkout and M. G. Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359–388, 2000.

[5]

Hani El Sakkout. Improving Backtrack Search: Three Case Studies of Localized Dynamic Hybridization. PhD thesis, Imperial College, London, June 1999.

[6]

T. Fruehwirth. Constraint simplification rules. Technical Report ECRC-92-18, ECRC Munich, Germany, July 1992. presented at CLP workshop at ICLP 92, Washington, USA, November 1992.

[7]

T. Fruehwirth. Temporal reasoning with constraint handling rules. Technical Report Core-93-8, ECRC Munich, Germany, January 1993.

[8]

T. Fruehwirth and Ph. Hanschke. Terminological reasoning with constraint handling rules. In First Workshop on the Principles and Practice of Constraint Programming, Newport, RI, USA, April 1993.

[9]

T. Frühwirth. Theory and practice of constraint handling rules. Logic Programming, 37(1-3):95–138, 1988.

[10]

C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191–244, 1997.

[11]

C. Holzbauer. OFAI clp(q,r) Manual. Technical Report TR-95-09, Austrian Research Institute for AI, Vienna, 1995.

[12]

ILOG. CPLEX. www.ilog.com/products/cplex/, 2001.

[13]

C. Le Pape and P. Baptiste. Resource constraints for preemptive job-shop scheduling. Constraints, 3(4):263–287, 1998.

[14]

T. Le Provost. Approximate Generalised Propagation. ESPRIT Project Deliverable CORE-93-7, also as CHIC-WP5-D.5.2.3.3, ECRC GmbH, January 1993.

[15]

T. Le Provost and M.G. Wallace. Domain-independent propagation (or Generalised Propagation). In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS’92), pages 1004–1011, June 1992.

[16]

T. Le Provost and M.G. Wallace. Generalized constraint propagation over the CLP Scheme. Journal of Logic Programming, 16(3-4):319–359, July 1993. Special Issue on Constraint Logic Programming.

[17]

Olivier Lhomme, Arnaud Gotlieb, Michel Rueher, and Patrick Taillibert. Boosting the interval narrowing algorithm. In Joint International Conference and Symposium on Logic Programming, pages 378–392, 1996.

[18]

L. Michel and P. Van Hentenryck. Localizer: A modeling language for local search. Lecture Notes in Computer Science, 1330, 1997.

[19]

Dash Optimization. XPRESS-MP. www.dash.co.uk/, 2001.

[20]

P. Van Hentenryck, D. McAllester, and D. Kapur. Solving polynomial systems using a branch and prune approach. SIAM Journal on Numerical Analysis, 1995.

[21]

Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA, 1989.

[22]

M.G. Wallace and J. Schimpf. Finding the right hybrid algorithm - a combinatorial meta-problem. Annals of Mathematics and Artificial Intelligence, 34(4):259–270, 2002.