Monge sequences and a simple assignment algorithm

Abstract

In 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like procedure for solving specially structured transportation problems. Here we present a ‘new’ approach for solving assignment problems which builts upon Monge's observation. The basic idea is to transform an arbitrary assignment problem into an ‘equivalent’ one where Monge's condition is fulfilled.