A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisfiability (SAT) called Unit-Walk. A dynamic prioritization heuristic has been developed to improve the algorithm, inspired by another algorithm called Squeaky Wheel Optimization.doi:10.1007/11564751_108 fatcat:xix5wbikwva2xif3fegwxwgth4