Talk:Assignment problem

From Wikipedia, the free encyclopedia

You have new messages (last change).

does anyone know why an assignment problem is intersting? Jfeckstein 14:18, 4 Aug 2003 (UTC)

Not I. But, I haven't studied any assignment problems, so I shouldn't expect to. Do you think that it isn't encyclopedic? It is probably useful, and maybe some mathematician will come in and give us some interesting examples. Paullusmagnus 14:31, 4 Aug 2003 (UTC)

It seems encyclopedic, and it is informative, but it could be even better. Jfeckstein 14:34, 4 Aug 2003 (UTC)

It could be better for sure. Sorry I was paranoid. Paullusmagnus 14:49, 4 Aug 2003 (UTC)

This should be linked to matching. Deco 22:45, 18 November 2005 (UTC)

The solution in "Solving an assignment problem" appears to lack symmetry, and could be wrong. It is definitely hard to read.

Also a proper article about the problem should present the known lower bound for it and an asymptotic algorithm for best (or most popular) existing algorithms. Otherwise the reader cannot see how hard the problem is. Wazow 17:42, 4 March 2006 (UTC)

What do you call the problem when agents rank the tasks in order of preference instead of assigning them costs? If that is also called the "assignment problem", it would be nice to describe it in this article; otherwise, it would be nice to link to a page that does describe the problem. Hashproduct 23:22, 5 November 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../a/s/s/Talk%7EAssignment_problem_5edc.html"