BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Computers and Operations Research
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Scalable Load Balancing in Nurse to Patient Assignment Problems
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An improved algorithm for optimal bin packing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Constraint Programming (CP) is a general technique for solving combinatorial optimization problems. Real world problems are quite complex and solving them requires to divide work into different parts. Mainly, there are: the abstraction of interesting and relevant subparts, the definition of benchmarks and design of a global model and the application of a particular search strategy. We propose to identify for each of these parts some common pitfalls and to discuss them. We will successively consider undivided model, rigid search, biased benchmarking and wrong abstraction.