By the same authors

Abstraction and Reformulation in the Generation of Constraint Models

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Publication details

DatePublished - 2007
Original languageUndefined/Unknown

Abstract

Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations