Dekker1/dekker-phd-thesis
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add abstract draft for general public

Browse Source
This commit is contained in:
Jip J. Dekker 2021-07-29 14:44:32 +10:00
parent b31cd335a0
commit c0740840eb
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
abstract_gp.txt Normal file
View File

@ -0,0 +1,5 @@
Real world problems, such as scheduling and routing problems, are often solved by creating constraint models.
These models are automatically rewritten for the use of dedicated solver programs.
Over the years, both the size of the problems and approaches taken by the solver programs have significantly changed.
This has meant that for some applications the rewriting process has become prohibitively inefficient.
This thesis proposes a more efficient structure for the rewriting process that makes constraint modelling a more powerful and attractive approach.