A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
DOI10.1016/S0377-2217(99)00050-8zbMATH Open0964.90005MaRDI QIDQ1972012FDOQ1972012
Authors: Adam Ouorou, Philippe Mahey 
Publication date: 20 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- About the minimum mean cycle-canceling algorithm
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
multicommodity flowmessage routingnetwork programmingtelecommunication networksseparable convex programmingminimum mean cycle cancelling
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mathematical programming (90C99)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Convex Analysis
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- A characterization of the minimum cycle mean in a digraph
- Title not available (Why is that?)
- Finding minimum-cost circulations by canceling negative cycles
- An Interior Point Method for Block Angular Optimization
- A new proximal decomposition algorithm for routing in telecommunication networks
- Title not available (Why is that?)
- Faster parametric shortest path and minimum‐balance algorithms
- Parametric shortest path algorithms with an application to cyclic staffing
- The flow deviation method: An approach to store‐and‐forward communication network design
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
Cited In (8)
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
- Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
- Title not available (Why is that?)
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Engineering Negative Cycle Canceling for Wind Farm Cabling
This page was built for publication: A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972012)
