6096182_Thesis.pdf (5.92 MB)
Download file

Effective Profiling of Tree Search in Constraint Programming

Download (5.92 MB)
thesis
posted on 08.04.2018, 23:05 authored by MAXIM SHISHMAREV
Combinatorial problems, which often occur in many areas of life, can be remarkably difficult to solve. Constraint programming is a modern approach to solving these problems, which involves describing the problem in a declarative language to form a model, and using general purpose solvers to search for solutions. How fast a high quality solution can be obtained is largely dependent on model used. This thesis designs an effective framework an associated techniques that help programmers in improving their models, so that they can obtain higher quality solutions faster.

History

Campus location

Australia

Principal supervisor

Guido Tack

Additional supervisor 1

Maria Garcia de la Banda

Additional supervisor 2

Christopher Mears

Year of Award

2018

Department, School or Centre

Caulfield School of IT

Course

Doctor of Philosophy

Degree Type

DOCTORATE

Faculty

Faculty of Information Technology

Usage metrics

Categories

Exports