1 vote

Anyone recognize this as a special type of multi-commodity flow problem?

I think you can solve this as a single shortest path problem with respect to arc weights $$\overline{w}_{ij}=\min\{-w_{ijp}\ :\ p\in\{1,\ldots,m\}\}.$$ For every arc $(i,j)$ fix some $p(i,j)\in\{1,\...
Thomas Kalinowski's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible