Integration OR Algorithms And Randomization With Constraint Programming
Final rept. 28 May 2003-24 Nov 2004
ILOG GENTILLY (FRANCE)
Pagination or Media Count:
This report results from a contract tasking ILOG as follows Several promising areas will be investigated more efficient use of linear programming. new and more powerful relaxation techniques use of column generation techniques integration of graph theoretic algorithms use of randomization to search branch-and-bound trees and symmetry breaking. Techniques that are developed will be tested on challenging problems where current constraint programming technology is limited.
- Numerical Mathematics