Sub-Problem Pre-Solving in MiniZinc

Constraint models often describe complicated problems that contain sub-problems that could be solved in sub-models. Although pre-solving these sub-models might improve the performance of the model, manually splitting the model to accommodate the occurrences of these sub-models can be a great inconve...

Full description

Bibliographic Details
Main Author: Dekker, Jip J.
Format: Others
Language:English
Published: Uppsala universitet, Institutionen för informationsteknologi 2016
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-307145
id ndltd-UPSALLA1-oai-DiVA.org-uu-307145
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-uu-3071452016-11-10T05:13:42ZSub-Problem Pre-Solving in MiniZincengDekker, Jip J.Uppsala universitet, Institutionen för informationsteknologi2016Constraint models often describe complicated problems that contain sub-problems that could be solved in sub-models. Although pre-solving these sub-models might improve the performance of the model, manually splitting the model to accommodate the occurrences of these sub-models can be a great inconvenience for the modeler. This thesis introduces an approach to automate the process of solving sub-models and replacing them by constraints that provide more inference, based on the solutions found. An implementation of this approach is provided for the MiniZinc language, and using various examples we show how the strain of the implementation of pre-solving is moved from the modeler to the modeling toolchain. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-307145IT ; 16082application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
description Constraint models often describe complicated problems that contain sub-problems that could be solved in sub-models. Although pre-solving these sub-models might improve the performance of the model, manually splitting the model to accommodate the occurrences of these sub-models can be a great inconvenience for the modeler. This thesis introduces an approach to automate the process of solving sub-models and replacing them by constraints that provide more inference, based on the solutions found. An implementation of this approach is provided for the MiniZinc language, and using various examples we show how the strain of the implementation of pre-solving is moved from the modeler to the modeling toolchain.
author Dekker, Jip J.
spellingShingle Dekker, Jip J.
Sub-Problem Pre-Solving in MiniZinc
author_facet Dekker, Jip J.
author_sort Dekker, Jip J.
title Sub-Problem Pre-Solving in MiniZinc
title_short Sub-Problem Pre-Solving in MiniZinc
title_full Sub-Problem Pre-Solving in MiniZinc
title_fullStr Sub-Problem Pre-Solving in MiniZinc
title_full_unstemmed Sub-Problem Pre-Solving in MiniZinc
title_sort sub-problem pre-solving in minizinc
publisher Uppsala universitet, Institutionen för informationsteknologi
publishDate 2016
url http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-307145
work_keys_str_mv AT dekkerjipj subproblempresolvinginminizinc
_version_ 1718392223994740736