Geoffrey Chu

Proceedings of the Principles and Practice of Constraint Programming, 2018

2016

Lagrangian Decomposition via Sub-problem Search.

[BibT_eX]

[DOI]

Graeme Gange

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Symmetry declarations for MiniZinc.

[BibT_eX]

[DOI]

Nathaniel Baxter

Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015

Projected Model Counting.

[BibT_eX]

[DOI]

CoRR, 2015

Dominance breaking constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

#∃SAT: Projected Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Learning Value Heuristics for Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Stable Model Counting and Its Application in Probabilistic Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Grounding Bound Founded Answer Set Programs.

[BibT_eX]

[DOI]

Rehan Abdul Aziz

Peter James Stuckey

CoRR, 2014

Symmetries, almost symmetries, and lazy clause generation.

[BibT_eX]

[DOI]

Christopher Mears

Constraints An Int. J., 2014

Nested Constraint Programs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Stable model semantics for founded bounds.

[BibT_eX]

[DOI]

Rehan Abdul Aziz

Theory Pract. Log. Program., 2013

Structure Based Extended Resolution for Constraint Programming.

[BibT_eX]

[DOI]

CoRR, 2013

On the Complexity of Global Scheduling Constraints under Structural Restrictions.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Improving Combinatorial Optimization - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Dominance Driven Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Exploiting subproblem dominance in constraint programming.

[BibT_eX]

[DOI]

Constraints An Int. J., 2012

A complete solution to the Maximum Density Still Life Problem.

[BibT_eX]

[DOI]

Artif. Intell., 2012

Maximising the Net Present Value for Resource-Constrained Project Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Inter-instance Nogood Learning in Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

A Generic Method for Identifying and Exploiting Dominance Relations.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

Improving combinatorial optimization.

[BibT_eX]

[DOI]

PhD thesis, 2011

Solving Talent Scheduling with Dynamic Programming.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

Symmetries and Lazy Clause Generation.

[BibT_eX]

[DOI]

Christopher Mears

Proceedings of the IJCAI 2011, 2011

2010

Automatically Exploiting Subproblem Equivalence in Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Constraint Programming to Solve Maximal Density Still Life.

[BibT_eX]

[DOI]

Karen Elizabeth Petrie

Neil Yorke-Smith

Proceedings of the Game of Life Cellular Automata., 2010

2009

Cache Conscious Data Structures for Boolean Satisfiability Solvers.

[BibT_eX]

[DOI]

Aaron Harwood

J. Satisf. Boolean Model. Comput., 2009

Confidence-Based Work Stealing in Parallel Constraint Programming.

[BibT_eX]

[DOI]

Christian Schulte

Proceedings of the Principles and Practice of Constraint Programming, 2009

Using Relaxations in Maximum Density Still Life.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Minimizing the Maximum Number of Open Stacks by Customer Search.

[BibT_eX]

[DOI]