On integrating constraint propagation and linear programming for combinatorial optimization
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Solving very large crew scheduling problems to optimality
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
On the system of two all_different predicates
Information Processing Letters
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
On the system of two all_different predicates
Information Processing Letters
Evaluating optimization models to solve SALBP
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
A constraint programming-based solution approach for medical resident scheduling problems
Computers and Operations Research
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Combining arc-consistency and dual lagrangean relaxation for filtering CSPs
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Parallel machine scheduling with flexible resources
Computers and Industrial Engineering
Optimal block design models for course timetabling
Operations Research Letters
The constraint of difference and total dual integrality
Proceedings of the 17th Panhellenic Conference on Informatics
| Hi-index | 0.00 |
The comparative performance of Integer Programming (IP) and Constraint Logic Programming (CLP) is explored by examining a number of models for four different combinatorial optimization applications. Computational results show contrasting behavior for the two approaches, and an analysis of performance with respect to problem and model characteristics is presented. The analysis shows that tightness of formulation is of great benefit to CLP where effective search reduction results in problems that can be solved quickly. In IP, if the linear feasible region does not identify the corresponding integer polytope, the problem may be difficult to solve. The paper identifies other characteristics of model behavior and concludes by examining ways in which IP and CLP may be incorporated within hybrid solvers.