Optimization-oriented global constraints

Constraints

Volumn 7, Issue 3-4, 2002, Pages 351-365

  Focacci, Filippo ^a   Lodi, Andrea ^b   Milano, Michela ^b  

^a IBM   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Constraint programming; Optimization problems; Relaxations

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

CONSTRAINT PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0036662852     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020589922418     Document Type: Conference Paper

References (27)

1. Baptiste, P., Le Pape, C., & Nuijten, W. (1995). Efficient operations research algorithms in constraint-based scheduling. In Proceedings of IJCAI'95, International Joint Conference on Artificial Intelligence.
2. Beringer, H., & De Backer, B. (1995). Combinatorial problem solving in constraint logic programming with cooperating solvers. In Beierle, C., & Plumer, L., eds., Logic Programming: Formal Methods and Practical Applications. North Holland.
3. Bockmayr, A., & Kasper, T. (1998). Branch-and-infer: a unifying framework for Integer and Finite Domain Constraint Programming. INFORMS J. Computing, 10(3): 287-300.
4. Brucker, P., & Thiele, O. (1996). A branch and bound method for the general shop problem with sequence dependent setup times. OR Spektrum, 18: 145-161.
5. Carpaneto, G., Martello, S., & Toth, P. (1988). Algorithms and codes for the assignment problem. In Simeone, B., et al., eds., Fortran Codes for Network Optimization-Annals of Operations Research, pages 193-223.
6. Caseau, Y., & Laburthe, F. (1995). Improving branch and bound for jobshop scheduling with constraint propagation. In Deza, M., Euler, R., & Manoussakis, Y., eds., Combinatorics and Computer Science, LNCS 1120, pages 129-149. Springer Verlag.
7. Caseau, Y., & Laburthe, F. (1997). Solving small TSPs with constraints. In Proceedings of the Fourteenth International Conference on Logic Programming-ICLP'97, pages 316-330.
8. Caseau, Y., & Laburthe, F. (1997). Solving various weighted matching problems with constraints. In Proceedings of CP'97, International Conference on Principles and Practice of Constraint Programming.
9. Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton Univ. Press.
10. Dell'Amico, M., & Martello, S. (1997). Linear assignment. In Maffoli, F., Dell'Amico, M., & Martello, S., eds., Annotated Bibliographies in Combinatorial Optimization, pages 355-371. Wiley.
11. Fischetti, M., & Toth, P. (1992). An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53: 173-197.
12. Focacci, F., Lodi, A., & Milano, M. (1999). Integration of CP and OR methods for Matching Problems. In CP-AI-OR'99 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.
13. Focacci, F., & Milano, M. (2001). Connections and integrations of dynamic programming and constraint programming. In CP-AI-OR'01 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems.
14. Focacci, F., Lodi, A., & Milano, M. (1999). Solving tsp with time windows with constraints. In ICLP'99 International Conference on Logic Programming.
15. Focacci, F., Lodi, A., & Milano, M. (2000). Cutting planes in constraint programming: an hybrid approach. In CP'2000 International Conference on Principles and Practice of Constraint Programming.
16. Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In ALPS'2000 International Conference on Artificial Intelligence Planning System.
17. Focacci, F., Lodi, A., Milano, M., & Vigo, D. (1998). Solving TSP through the integration of OR and CP techniques. Proceedings CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints.
18. Jünger, M., Reinelt, G., & Rinaldi, G. (1997). The Travelling Salesman Problem. In Dell'Amico, M., Maffioli, F., & Martello, S., eds., Annotated Bibliographies in Combinatorial Optimization. Wiley.
19. Nemhauser, G.L., & Wolsey, L.A. (1988). Integer and Combinatorial Optimization. John Wiley and Sons.
20. Pesant, G., Gendreau, M., Potvin, J.Y., & Rousseau, J.M. (1998). An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science, 32(1): 12-29.
21. Pesant, G., Gendreau, M., Potvin, J.Y., & Rousseau, J.M. (1999). On the flexibility of constraint programming models: from single to multiple time windows for the travelling salesman problem. European Journal of Operational Research, 117(2): 253-263.
22. Puget, J.F. (1994). A C++ implementation of CLP. Technical Report 94-01, ILOG Headquarters.
23. Refalo, P. (2000). Linear formulation of constraint programming models and hybrid solvers. In CP'2000 International Conference on Principles and Practice of Constraint Programming.
24. Régin, J.C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of AAAI'94-National Conference on Artificial Intelligence.
25. Reinelt, G. (1991). TSPLIB - a travelling salesman problem library. ORSA Journal on Computing, 3: 376-384.
26. Rodosek, R., Wallace, M., & Hajian, M.T. (1997). A new approach to integrating mixed integer programming and constraint logic programming. In Annals of Operational Research, Recent Advances in Combinatorial Optimization.
27. Simonis, H. (1995). Calculating lower bounds on a resource scheduling problem. Technical Report, Cosytec.