Mathematical programming techniques in constraint programming: A short overview

Journal of Heuristics

Volumn 8, Issue 1, 2002, Pages 7-17

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

^a UNIVERSITY OF FERRARA   (Italy)

^b IBM   (United States)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Constraint programming; Integration; Mathematical programming

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; CONSTRAINT PROGRAMMING; FINITE DOMAINS;

LOGIC PROGRAMMING;

EID: 0036175860     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013653332557     Document Type: Article

References (46)

1. On the solution of traveling salesman problems
2. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
3. Finite domain and cutting plane techniques in CLP(PB)
4. Combinatorial problem solving in constraint logic programming with cooperating solvers
5. Pseudo-Boolean and finite domain constraint programming: A case study
6. Branch-and-infer: A unifying framework for integer and finite domain constraint programming
7. An algorithm for solving job shop scheduling
8. Improving branch and bound for job-shop scheduling with constraint propagation
9. Solving small TSPs with constraints
10. Solving various weighted matching problems with constraints
11. Heuristics for large constrained routing problems
12. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming
13. Solving vehicle routing problems using constraint programming and meta-heuristics
14. Probe backtrack search for minimal perturbation in dynamic scheduling
15. Constraint programming based column generation for crew assignment
16. Greedy randomized adaptive search procedures
17. Local search and constraint programming
18. Cost-based domain filtering
19. Solving TSP with time windows with constraints
20. Cutting planes in constraint programming: An hybrid approach
21. Towards a closer integration of finite domain propagation and simplex-based algorithms
22. Limited discrepancy search
23. An example of integrating constraint programming and mathematical programming
24. Comparing constraint programming and mathematical programming approaches to discrete optimisation-the change problem
25. Constraint satisfaction methods for generating valid cuts
26. Mixed logical/linear programming
27. On integrating constraint propagation and linear programming for combinatorial optimization
28. Constraint based job shop scheduling with ILOG scheduler
29. Mixed global constraints and inference in hybrid CLP-IP solvers
30. Linear relaxation and reduced cost based propagation of continuous variable subscript
31. A view of local search in constraint programming
32. Integer linear programming and constraint programming approaches to a template design problem
33. Tight cooperation and its application in piecewise linear optimization
34. Linear formulation of constraint programming models and hybrid solvers
35. A filtering algorithm for constraints of difference in CSPs
36. The symmetric alldiff constraint
37. A new approach to integrating mixed integer programming and constraint logic programming
38. Using constraint programming and local search methods to solve vehicle routing problems
39. The progressive party problem: Integer linear programming and constraint programming compared
40. Generality versus specificity: An experience with AI and OR techniques