A Heuristic Method for Solving the Problem of Partitioning Graphs with Supply and Demand

2 Nov 2014Raka JovanovicAbdelkader BousselhamStefan Voss

In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.