Constraint programming and maths programming

Knowledge Engineering Review

Volumn 16, Issue 1, 2001, Pages 5-23

  Puget, Jean François ^a   Lustig, Irvin ^b  

^a IBM   (United States)

^b 1 LOG Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIALS;

CONSTRAINT PROGRAMMING (CP); MATHS PROGRAMMING (MP);

LINEAR PROGRAMMING;

EID: 0346906732     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888901000042     Document Type: Article

References (31)

1. Aggoun, A and Beldiceanu, N, 1993, "Extending CHIP to solve complex scheduling problems" Mathematical and Computer Modeling 17(7) 57-73.
2. Baptiste, P, Le Pape, C and Nuijten, P, 1995, "Incorporating efficient operations research algorithms in constraint-based scheduling" Proceedings of 1st International Joint Workshop on Artificial Intelligence and Operations Research, Timberline, Oregon.
3. Beale, ELM and Tomlin, JA, 1970, "Special facilities in general mathematical programming system for non-convex problems using ordered sets of variables" Proceedings of the Fifth International Conference on Operations Research 447-454.
4. Beldiceanu, N and Contejean, E, 1994, "Introducing global constraints in CHIP" Mathematical and Computer Modeling 20(12) 97-123.
5. Beringer, H and De Backer, B, 1995, "Combinatorial problem solving in constraint logic programrming with cooperating solvers" in C Beirle and L Plumer (eds) Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence, Elsevier.
6. Bockmayr, A and Kasper, T, 1998, "Branch and infer: a unifying framework for integer and finite domain constraint programming" INFORMS J. Computing 10(3) 287-300.
7. Carlsson, M, 1995, SICStus Prolog User's Manual. SICS Research Report Swedish Institute of Computer Science.
8. Caseau, Y and Laburthe, F, 1995, "The Claire documentation" LIENS Report 96-15 Ecole Normale Superieure, Paris.
9. Colmerauer, A, 1990, "Une introduction à PROLOG III" Actes AVIGNON 90 27-70.
10. Dantzig, GB, 1948, "Programming in a linear structure" Comptroller, USAF, February.
11. Focacci, F, Lodi, A and Milano, M, 1999a, "Cost-based domain filtering" in J Jaffar (ed.) Principle and Practice of Constraint Programming Lecture Notes in Computer Science, Springer.
12. Focacci, F, Lodi, A and Milano, M, 1999b, "Solving TSP with time windows with constraints" Sixteenth International Conference on Logic Programming.
13. Jaffar, J and Lassez, J-L, 1987, Constraint Logic Programming. Proceedings of POPL 1987.
14. Karmarkar, N, 1984, "A new polynomial-time algorithm for linear programming" Combinatorica 4 373-395.
15. Khachiyan, LG, 1979, "A polynomial algorithm in linear programming" Soviet Mathematics Doklady 20 191-194.
16. Lauriere, J-L, 1978, "A language and a program for stating and solving combinatorial problems Artificial Intelligence 10(1).
17. Lustig, IJ, Marsten, RE and Shanno, DF, 1994, "Interior-point methods for linear programming: Computational state of the art" ORSA Journal on Computing 6 1-14.
18. Mackworth, AK, 1977, "Consistency in networks of relations" Artificial Intelligence 8 99-118.
19. Nembauser, GL and Wolsey LA, 1988, Integer and Combinatorial Optimization Wiley, Chichester.
20. Nemhauser, GL, Savelsberg, MWP and Sigismondi, GC, 1994, "MINTO, a Mixed INTeger Optimizer" Operations Research Letters 15 47-58.
21. Ottoson, G, Thorsteinsson, ES and Hooker, JN, 1999, "Mixed global constraints and inference in hybrid CLP-IP solvers" CP99 Post-Conference Workshop on Large-Scale Combinatorial Optimization and Constraints.
22. Puget, J-F, 1998, "A fast algorithm for the bound consistency of alldiff constraints" Proceedings of 15th National Conference on Artificial Intelligence (AAAI-98) 359-366.
23. Puget, J-F and Leconte, M, 1995, "Beyond the glass box: constraints as objects" Logic Programming: Proceedings of the 1995 International Symposium 513-527.
24. Refalo, P, 1999, "Tight cooperation and its application in piecewise linear optimization" in J. Jaffar (ed.) Principle and Practice of Constraint Programming Lecture Notes in Computer Science, Springer.
25. Regin, JC, 1994, "A filtering algorithm for constraints of difference in CSPs" Proceedings of the 12th National Conference on Artificial Intelligence 362-367.
26. Regin, JC, 1999, "Arc consistency for global cardinality constraints with cost" in J. Jaffar (ed.) Principle and Practice of Constraint Programming Lecture Notes in Computer Science, Springer.
27. Rodosek, R, Wallace, M and Hajian, M, 1997, A New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming Baltzer Journals.
28. Smolka, G, 1993, "Survey of Oz: a higher-order concurrent constraint language" Proceedings of ICLP'93 Post-Conference Workshop on Concurrent Constraint Programming.
29. Van Hentenryck, P, 1989, Constraint Satisfaction in Logic Programming MIT Press.
30. Van Hentenryck, P, 1999, The OPL Optimization Programming Language MIT Press.
31. Wolsey, LA, 1998, Integer Programming John Wiley & Sons.