A Network Flow Algorithm for Solving Generalized Assignment Problem

Algorithm 1

Algorithm for GAP.

	Initial settings: . Label source node . Let be a given integer number such that .
	whiledo
	Remove all labels of node .
	whiledo
	, where .
	ifthen
	.
	end if
	ifthen
	Node is labeled with , .
	end if
	ifthen
	Node is labeled with , .
	end if
	end while
	end while