Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...