References
-
[1]
-
N. Beldiceanu, E. Bourreau, P. Chan, and D. Rivreau.
Partial search strategy in CHIP.
In 2nd International Conference on Metaheuristics - MIC 97,
Sophia Antipolis, France, July 1997.
- [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]
-
H. Beringer and B. de Backer.
Combinatorial Problem Solving in Constraint Logic Programming
with Cooperating Solvers, pages 245–272.
Elsevier, 1995.
- [4]
-
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.
- [5]
-
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.
- [6]
-
Ivan Bratko.
Prolog Programming for Artificial Intelligence.
International Computer Science. Addison-Wesley, 1986.
- [7]
-
H. H. El Sakkout and M. G. Wallace.
Probe backtrack search for minimal perturbation in dynamic
scheduling.
Constraints, 5(4):359–388, 2000.
- [8]
-
F. Focacci, A. Lodi, and M. Milano.
Cost-based domain filtering.
In CP’99, volume 1713 of LNCS, pages 189–203.
Springer, 1999.
- [9]
-
T. Frühwirth.
Theory and practice of constraint handling rules.
Logic Programming, 37(1-3):95–138, 1988.
- [10]
-
Pascal Van Hentenryck, Yves Deville, and Choh-Man Teng.
A generic arc-consistency algorithm and its specializations.
Artificial Intelligence, 57(2-3):291–321, 1992.
- [11]
-
ILOG.
CPLEX.
www.ilog.com/products/cplex/, 2001. - [12]
-
Robert Kowalski.
Algorithm = logic + control.
Communications of the ACM, 22(7):424–436, 1979.
- [13]
-
C. Le Pape and P. Baptiste.
Resource constraints for preemptive job-shop scheduling.
Constraints, 3(4):263–287, 1998.
- [14]
-
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.
- [15]
-
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.
- [16]
-
Alan K. Mackworth.
Consistency in networks of relations.
Artificial Intelligence, 8:99–118, 1977.
- [17]
-
Kim Marriott and Peter J. Stuckey.
Programming with Constraints.
MIT Press, 1998.
- [18]
-
L. Michel and P. Van Hentenryck.
Localizer: A modeling language for local search.
Lecture Notes in Computer Science, 1330, 1997.
- [19]
-
E. Nowicki and C. Smutnicki.
A fast taboo search algorithm for the job shop problem.
Management Science, 42(6):797–813, June 1996.
- [20]
-
Dash Optimization.
XPRESS-MP.
www.dash.co.uk/, 2001. - [21]
-
P. Refalo.
Tight cooperation and its application in piecewise linear
optimization.
In CP’99, volume 1713 of LNCS, pages 375–389.
Springer, 1999.
- [22]
-
R. Rodosek, M. G. Wallace, and M. T. Hajian.
A new approach to integrating mixed integer programming and
constraint logic programming.
Annals of Operations Research, 86:63–87, 1999.
Special issue on Advances in Combinatorial Optimization.
- [23]
-
R. Rodosek and M.G. Wallace.
A generic model and hybrid algorithm for hoist scheduling problems.
In Proceedings of the 4th International Conference on Principles
and Pract ice of Constaint Programming, pages 385–399, Pisa, 1998.
- [24]
-
Joachim Schimpf.
Logical loops.
In Peter. J. Stuckey, editor, Proceedings of the 18th
International Conference on Logic Programming, pages 224–238. Springer,
July/August 2002.
- [25]
-
Edward Tsang.
Foundations of Constraint Satisfaction.
Academic Press, 1993.
- [26]
-
P. Van Hentenryck, D. McAllester, and D. Kapur.
Solving polynomial systems using a branch and prune approach.
SIAM Journal on Numerical Analysis, 1995.
- [27]
-
Pascal Van Hentenryck.
Constraint Satisfaction in Logic Programming.
Logic Programming Series. MIT Press, Cambridge, MA, 1989.
- [28]
-
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.
- [29]
-
Matthew L. Ginsberg William D. Harvey.
Limited discrepancy search.
In Chris S. Mellish, editor, Proceedings of the Fourteenth
International Joint Conference on Artificial Intelligence (IJCAI-95); Vol.
1, pages 607–615, Montréal, Québec, Canada, August 20-25 1995.
Morgan Kaufmann, 1995.
- [30]
-
H.P. Williams.
Model Building in Mathematical Programming.
Management Science. Wiley, 4th edition, 1999.