Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
From MaRDI portal
Publication:5449668
DOI10.1002/net.20208zbMath1180.90353MaRDI QIDQ5449668
Bernard Gendron, Mauricio C. de Souza, Philippe Mahey
Publication date: 12 March 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20208
90C35: Programming involving graphs or networks
Related Items
Engineering Negative Cycle Canceling for Wind Farm Cabling, A conic quadratic formulation for a class of convex congestion functions in network flow problems, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
Cites Work