Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...