This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

In the database context, the hypertree decomposition method is used for query optimization,
whereby conjunctive queries having a low degree of cyclicity can be recognized and …

Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Project controls have traditionally been focused on after-the-fact detection of variances. This
thesis proposes a control system, the Last Planner system, that causes the realization of …

This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …

Writing the second edition of this text was a wonderful opportunity for a more mature
presentation than I was able to give 13 years ago. The intent still is to give a self-contained …

We present in this paper a new, complete method for distributed constraint optimization,
based on dynamic programming. It is a utility propagation method, inspired by the sum …

Several important decision problems on conjunctive queries (CQs) are NP-complete in
general but become tractable, and actually highly parallelizable, if restricted to acyclic or …

Many combinatorial search problems can be expressed as “constraint satisfaction problems”
and this class of problems is known to be NP-complete in general. In this paper, we …