Parallel depth first search. Part II. analysis
International Journal of Parallel Programming
Optimal scheduling in film production to minimize talent hold cost
Journal of Optimization Theory and Applications
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Integer Programming and Conway's Game of Life
SIAM Review
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
Dynamic Programming to Minimize the Maximum Number of Open Stacks
INFORMS Journal on Computing
Journal of Artificial Intelligence Research
Breaking symmetries in all different problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation = lazy clause generation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Confidence-based work stealing in parallel constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Minimizing the maximum number of open stacks by customer search
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Using relaxations in maximum density still life
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving Talent Scheduling with Dynamic Programming
INFORMS Journal on Computing
Automatically exploiting subproblem equivalence in constraint programming
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A complete solution to the Maximum Density Still Life Problem
Artificial Intelligence
Symmetries and lazy clause generation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Hi-index | 0.00 |
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint projection that allows us to exploit subproblem dominances that arise when two different search paths lead to subproblems which are identical on the remaining unfixed variables. We present a new symmetry breaking technique called SBDS-1UIP, which extends Symmetry Breaking During Search (SBDS) by using the more powerful 1UIP nogoods generated by Lazy Clause Generation (LCG) solvers. We present two new general methods for exploiting almost symmetries by modifying SBDS-1UIP and by using conditional symmetry breaking constraints. We solve the Minimization of Open Stacks Problem, the Talent Scheduling Problem (CSPLib prob039), and the Maximum Density Still Life Problem (CSPLib prob032) many orders of magnitude faster than the previous state of the art by applying various powerful techniques such as nogood learning, dynamic programming, dominance and relaxations. We present cache aware data structures for SAT solvers which allows sequential and parallel versions of SAT solvers to run more quickly. And we present a new load balancing scheme for parallel search called confidence based work stealing, which allows the parallel search to make use of the information contained in the branching heuristic.