Suppose that I have a graph and a set of requests between node pairs. For each request, I need to find a path with maximum capacity (the maximum of the minimum capacity of the links in the path). Besides, each node has a capacity and the nodes in the path consume the node capacity. I want to serve as many requests as possible (maximizing the request of it).
In summary, it's a widest path problem with node capacity constraints. How can I solve it?