We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, ...

In naturalistic multi-cue and multi-step learning tasks, where outcomes of behavior are delayed in time, discovering which choices are responsible for rewards can present a challenge, known as the ...

Abstract: The assignment problem is an archetypal combinatorial optimization problem. This paper presents a neural network based on a dynamic model for solving the assignment problem. The main idea is ...

Abstract: Assignment problems are very challenging combinatorial problem which are often used to compare the performance of various algorithms. In this paper, we are dealing with an interesting ...