A Note on Mixed Set Programming
Jianyang Zhou · 2008
Abstract This short paper presents the “Mixed Set Programming ” framework of NCL in model-ing and solving constraint satisfaction problems over a mixed domain of reals, integers, Booleans, references, and sets. Modeling abstraction and the solving of a few hard combinatorial problems such as set partitioning and job-shop scheduling are illustrated.