Reviewer Assignment Problem (RAP): The challenge of matching academic submissions to suitable reviewers while optimising for expertise, subject coverage, workload balance, and avoidance of ...

The quadratic assignment problem (QAP) is a NP-hard combinatorial optimization problem. Genetic algorithm (GA) is one of the best algorithms to deal with such difficult problems. This paper presents ...

The generalized assignment problem examines the maximum profit assignments of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new ...

We present an origin-based algorithm for the traffic assignment problem, which is similar conceptually to the algorithm proposed by Gallager and Bertsekas for routing in telecommunication networks.