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

We extend the (1 — 1/e)-approximation algorithm to a constant-factor approximation algorithms for a nonseparable assignment problem with applications in maximizing revenue for budget-constrained ...

The class of simplicial decomposition (SD) schemes has shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are ...