A model seeker: Extracting global constraint models from positive examples
We describe a system which generates finite domain constraint models from positive
example solutions, for highly structured problems. The system is based on the global …
example solutions, for highly structured problems. The system is based on the global …
Global constraint catalog
N Beldiceanu, M Carlsson, JX Rampon - 2010 - diva-portal.org
This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …
described in terms of graph properties and/or automata and/or first order logical formulae …
A linear time approximation scheme for Euclidean TSP
Y Bartal, LA Gottlieb - 2013 IEEE 54th Annual Symposium on …, 2013 - ieeexplore.ieee.org
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization
problems. The special case of TSP in bounded-dimensional Euclidean spaces has been a …
problems. The special case of TSP in bounded-dimensional Euclidean spaces has been a …
Minizinc with functions
Functional relations are ubiquitous in combinatorial problems–the Global Constraint Catalog
lists 120 functional constraints. This paper argues that the ability to express functional …
lists 120 functional constraints. This paper argues that the ability to express functional …
Using finite transducers for describing and synthesising structural time-series constraints
We describe a large family of constraints for structural time series by means of function
composition. These constraints are on aggregations of features of patterns that occur in a …
composition. These constraints are on aggregations of features of patterns that occur in a …
Modelseeker: Extracting global constraint models from positive examples
We describe a system which generates finite domain constraint models from positive
example solutions, for highly structured problems. The system is based on the global …
example solutions, for highly structured problems. The system is based on the global …
Describing and generating solutions for the EDF unit commitment problem with the ModelSeeker
We present an application to extract and solve constraint models from sample solutions of
the Unit Commitment Problem of EDF, which computes the power output for each power …
the Unit Commitment Problem of EDF, which computes the power output for each power …
Global constraint catalog, (revision a)
N Beldiceanu, M Carlsson, JX Rampon - 2012 - diva-portal.org
This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …
described in terms of graph properties and/or automata and/or first order logical formulae …
MiniBrass: soft constraints for MiniZinc
Over-constrained problems are ubiquitous in real-world decision and optimization problems.
Plenty of modeling formalisms for various problem domains involving soft constraints have …
Plenty of modeling formalisms for various problem domains involving soft constraints have …
Towards solver-independent propagators
We present an extension to indexicals to describe propagators for global constraints. The
resulting language is compiled into actual propagators for different solvers, and is solver …
resulting language is compiled into actual propagators for different solvers, and is solver …