Graph Partitioning in k-partition with some constraints !

I am going to partition my undirected graph(in matrix shape) in k-partitions, but in such a way that each partitions doesn't have more than predefined RMax which is the maximum number of resources allocated to each partition(obviously each node has the specific number of resoursec so the sum of all nodes in each partition is its resources which should not more than RMax). Also about predefined BMax which is constraint on Bandwidth(on in the other words the Edge cuts) between each partitions in such a way the edge cuts between each partitions should not more than BMax. I will be appriciate you in advance if could help me because it is my major dramatic problem. Thanks in advance and I am looking for your kindly answers