Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities

This publication has 8 references indexed in Scilit:

• Relaxation Methods for Network Flow Problems with Convex Arc Costs
  SIAM Journal on Control and Optimization, 1987
• A unified framework for primal-dual methods in minimum cost network flow problems
  Mathematical Programming, 1985
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
  SIAM Journal on Computing, 1985
• Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
  Management Science, 1984
• A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
  Journal of the Operations Research Society of Japan, 1984
• A Class of Decentralized Routing Algorithms Using Relaxation
  IEEE Transactions on Communications, 1977
• A Minimum Delay Routing Algorithm Using Distributed Computation
  IEEE Transactions on Communications, 1977
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970