Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...