A relaxation of the cumulative constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 686-691

  Hooker, John N ^a   Yan, Hong ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING;

CONSTRAINT PROGRAMMING; CONTINUOUS RELAXATION; CUMULATIVE CONSTRAINTS; FACET-DEFINING INEQUALITIES; GLOBAL CONSTRAINTS; HYBRID METHOD; RESOURCE CONSUMPTION; VALID INEQUALITY;

COMPUTER PROGRAMMING;

EID: 33646191231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_46     Document Type: Conference Paper

References (19)

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.
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.
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.
4. Demassey, S., C. Artigues and P. Michelon, A hybrid constraint propagationcutting 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.
5. Heipcke, S. 1999. Combined Modelling and Problem Solving in Mathematical Programming and Constraint Programming, Ph.D. Thesis, University of Buckingham.
6. Hooker, J. N. 1995. Logic-based Benders decomposition, presented at INFORMS 1995.
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.
8. Hooker, J. N. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley (New York).
9. Hooker, J. N. 2001. Logic, optimization and constraint programming, to appear in INFORMS Journal on Computing.
10. Hooker, J. N., and, M. A. Osorio. 1999. Mixed logical/linear programming, Discrete Applied Mathematics 96-97 395–442.
11. Hooker, J. N., and G. Ottosson, Logic-based Benders decomposition, to appear in Mathematical Programming.
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.
13. Ottosson, G., and E. Thorsteinsson. 2000. Linear relaxations and reduced-cost based propagation of continuous variable subscripts, CP’AI’OR’00.
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.
16. Thorsteinsson, E. S. 2001. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming, CP01.
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.
18. Williams, H. P., and Hong Yan. 2001. Representations of the all-different predicate, INFORMS Journal on Computing, to appear.
19. Yan, H., and J. N. Hooker. 1999. Tight representation of logical constraints as cardinality rules, Mathematical Programming 85 363–377.