A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
From MaRDI portal
Publication:1972012
DOI10.1016/S0377-2217(99)00050-8zbMath0964.90005MaRDI QIDQ1972012
Publication date: 20 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
network programming; telecommunication networks; multicommodity flow; message routing; separable convex programming; minimum mean cycle cancelling
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
90C99: Mathematical programming
Related Items
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric shortest path algorithms with an application to cyclic staffing
- A characterization of the minimum cycle mean in a digraph
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- Finding minimum-cost circulations by canceling negative cycles
- An Interior Point Method for Block Angular Optimization
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- The flow deviation method: An approach to store‐and‐forward communication network design
- Convex Analysis
- Faster parametric shortest path and minimum‐balance algorithms
