0
votes
1answer
171 views

Edge weight function for graph instance of scheduling and allocation problem

I have difficulties developing a proper (non-scalar) edge cost function $c_e$ for my resource scheduling problem, which I mapped into a graph problem. Processes $P_i$ need resources $R_i \in ...
3
votes
1answer
310 views

The Hungarian Algorithm

In reading the proof of the Hungarian algorithm for the assignment problem in a weighted bigraph, I could not understand why the algorithm terminates. In the algorithm we choose a cover (namely labels ...