This is not an assignment problem. It is more of scheduling problem. The answer 33 that you get is because of the following logic: Since there is only one super computer to be used by all the tasks, you want it to be as free as possible. Hence you schedule...

c++,algorithm,segmentation-fault,matching,hungarian-algorithm

I think what you want is a version of a maximum matching for a graph that is not bipartite. There is an algorithm described for this at http://en.wikipedia.org/wiki/Blossom_algorithm, and the very last paragraph talks about the weighted case. You want a minimum cost matching, but every maximum matching has the...

algorithm,sum,max,hungarian-algorithm

This looks like the Transportation Problem to me. It can be solved using the Hungarian Algorithm though. First let's set up the matrix for the Hungarian Algorithm. The Hungarian Algorithm is used to find the minimum sum. To make it solve a maximum sum problem you would first have to...

This really looks like a bug with the munkres library. The print_matrix is just a "convenience" function and I'd suggest filing a bug report and in the interim just replacing it with something like the following (which is just their code with a fix to avoid trying to apply 0...

algorithm,matrix,hungarian-algorithm

There's a primal-dual algorithm due to Edmonds (the Blossom algorithm), which you really don't want to implement yourself if possible. Vladimir Kolmogorov has an implementation that may be suitable for your purposes.