Original title: Constraint modelling
Translated title: Constraint modelling
Authors: Haničinec, Tomáš ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
Document type: Bachelor's theses
Year: 2007
Language: eng
Abstract: Constraint programming is one of the possible ways how to solve complicated combinatorial (and other) problems. We model a problem using variables representing real world objects and constraints representing various relations between the objects. However, there are often many possible ways how to model a problem. And what's more, the choice of a modeling strategy can a®ect the resulting efficiency dramatically. Unfortunately, there is no general recipe how to model problems e±ciently. Nevertheless there are still several modeling techniques, heuristics or advices that could improve the e±ciency of models. Some of these techniques are problem dependent, some can be applied only to a certain classes of problems but they still often help. This thesis is trying to give more or less complete list of the most important modeling techniques along with an explanation of why, how and for which classes of problems they work best and also with empirical results underlying the presented facts.

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/13020

Permalink: http://www.nusl.cz/ntk/nusl-496852


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Bachelor's theses