A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
An algebraic approach to assignment problems
1977
Mathematical programming
For assignment problems a class of objective functions is studied by algebraic methods and characterized in terms of an axiomatic system. It says essentially that the coefficients of the objective function can be chosen from a totally ordered commutative semigroup, which obeys a divisibility axiom. Special cases of the general model are the linear assignment problem, the linear bottleneck problem, lexicographic multicriteria problems, p-norm assignment problems and others. Further a polynomial
doi:10.1007/bf01593800
fatcat:4mbv3bw5t5d7zafpzgrypbhg7e