Abstract: A method of assigning a resource from amongst a plurality of resources to a resource-utilizing entity from amongst a plurality of resource-utilizing entities, wherein a resource-to-resource-utilizing entity assignment has an associated cost. The method includes computing network flow costs of assignments for assigning resources to the resource-utilizing entities. The method constructs a flow network including source nodes corresponding to the resources, transhipment nodes corresponding to the assignments and a demand node, the flow network having arcs representing flow between the nodes, each arc having an associated network flow cost. The method then solves a Minimum Cost Flow problem for the flow network with negated arc costs to obtain flow values for the assignments, and assigns a resource to a resource-utilizing entity dependent on the flow value obtained.

Abstract: A method of assigning a resource from amongst a plurality of resources to a resource-utilising entity from amongst a plurality of resource-utilising entities, wherein a resource-to-resource-utilising entity assignment has an associated cost. The method includes computing network flow costs of assignments for assigning resources to the resource-utilising entities. The method constructs a flow network including source nodes corresponding to the resources, transhipment nodes corresponding to the assignments and a demand node, the flow network having arcs representing flow between the nodes, each arc having an associated network flow cost. The method then solves a Minimum Cost Flow problem for the flow network with negated arc costs to obtain flow values for the assignments, and assigns a resource to a resource-utilising entity dependent on the flow value obtained.