Reviewer assignment algorithms and systems have emerged as critical tools in modern academic publishing and research evaluation, ensuring that submitted manuscripts are matched with expert reviewers ...

This is a preview. Log in through your library . Abstract Until recently, analyses of the assignment problem have considered only restricted forms of the functions which relate the costs of travel to ...

This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch-and-bound algorithms for this problem can benefit from it. The bound is ...