A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

DOI10.1016/S0377-2217(99)00050-8MaRDI QIDQ1972012zbMATH OpenFDO

Authors Adam Ouorou, Philippe Mahey

Publication date 20 November 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

multicommodity flowmessage routingnetwork programmingtelecommunication networksseparable convex programmingminimum mean cycle cancelling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mathematical programming (90C99)

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

Cites work

• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3431955 (Why is no real title available?)
• A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
• A characterization of the minimum cycle mean in a digraph
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• A new proximal decomposition algorithm for routing in telecommunication networks
• A survey of algorithms for convex multicommodity flow problems
• An Interior Point Method for Block Angular Optimization
• Convex Analysis
• Faster parametric shortest path and minimum‐balance algorithms
• Finding minimum-cost circulations by canceling negative cycles
• Network flows. Theory, algorithms, and applications.
• Parametric shortest path algorithms with an application to cyclic staffing
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• The flow deviation method: An approach to store‐and‐forward communication network design

Cited in

(8)

• Multicommodity network flows: A survey. II: Solution methods
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• 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
• Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• 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)