A Relaxation of the Cumulative Constraint

1. Aggoun, A., and N. Beldiceanu, Extending CHIP in order to solve complex scheduling and placement problems, Mathematical and Computer Modelling 17 (1993) 57–73.

   Article  MathSciNet  Google Scholar 

2. Baptiste, P., and C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Principles and Practice of Constraint Programming (CP 97), Springer-Verlag (Berlin, 1997) 375–89.

   Google Scholar 

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

   Article  MathSciNet  MATH  Google Scholar 

4. Demassey, S., C. Artigues and P. Michelon, A hybrid constraint propagation-cutting plane algorithm for the RCPSP, 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR’02), Le Croisic, France (2002) 321–331.

   Google Scholar 

5. Heipcke, S. 1999. Combined Modelling and Problem Solving in Mathematical Programming and Constraint Programming, Ph.D. Thesis, University of Buckingham.

   Google Scholar 

6. Hooker, J. N. 1995. Logic-based Benders decomposition, presented at INFORMS 1995.

   Google Scholar 

7. Hooker, J. N. 1997. Constraint satisfaction methods for generating valid cuts, in D. L. Woodruff, ed., Advances in Computational and Stochasic Optimization, Logic Programming and Heuristic Search, Kluwer (Dordrecht) 1–30.

   Google Scholar 

8. Hooker, J. N. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley (New York).

   Book  MATH  Google Scholar 

9. Hooker, J. N. 2001. Logic, optimization and constraint programming, to appear in INFORMS Journal on Computing.

   Google Scholar 

10. Hooker, J. N., and M. A. Osorio. 1999. Mixed logical/linear programming, Discrete Applied Mathematics 96-97 395–442.

    Google Scholar 

11. Hooker, J. N., and G. Ottosson, Logic-based Benders decomposition, to appear in Mathematical Programming.

    Google Scholar 

12. Jain, V., and I. E. Grossmann. 1999. Algorithms for hybrid MILP/CLP models for a class of optimization problems, INFORMS Journal on Computing, to appear.

    Google Scholar 

13. Ottosson, G., and E. Thorsteinsson. 2000. Linear relaxations and reduced-cost based propagation of continuous variable subscripts, CP’AI’OR’00.

    Google Scholar 

14. Ottosson, G., E. Thorsteinsson, and J. N. Hooker. 1999. Mixed global constraints and inference in hybrid CLP-IP solvers, CP99 Post-Conference Workshop on Large Scale Combinatorial Optimization and Constraints, http://www.dash.co.uk/wscp99, 57–78.

15. Réfalo, P. 1999. Tight cooperation and its application in piecewise linear optimization, in J. Jaffar, ed., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 1713, Springer (Berlin), 373–389.

    Google Scholar 

16. Thorsteinsson, E. S. 2001. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming, CP01.

    Google Scholar 

17. Williams, H. P., and J. M. Wilson. 1998. Connections between integer linear programming and constraint logic programming-An overview and introduction to the cluster of articles, INFORMS Journal on Computing 10 261–264.

    Article  MathSciNet  MATH  Google Scholar 

18. Williams, H. P., and Hong Yan. 2001. Representations of the all-different predicate, INFORMS Journal on Computing, to appear.

    Google Scholar 

19. Yan, H., and J. N. Hooker. 1999. Tight representation of logical constraints as cardinality rules, Mathematical Programming 85 363–377.

    Article  MathSciNet  MATH  Google Scholar 

Download references