- Article
Widest Path in Networks with Gains/Losses
- Javad Tayyebi,
- Mihai-Lucian Rîtan and
- Adrian Marius Deaconu
In this paper, the generalized widest path problem (or generalized maximum capacity problem) is studied. This problem is denoted by the GWPP. The classical widest path problem is to find a path from a source (s) to a sink (t) with the highest capacit...