A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
type: Item
instance of: scholarly article
title: A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
zbMATH Open document ID: 0964.90005
DOI: 10.1016/S0377-2217(99)00050-8
author: Adam Ouorou
author: Philippe Mahey
published in: European Journal of Operational Research
publication date: 2000-11-20T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 1423594
zbMATH Keywords: network programming
zbMATH Keywords: separable convex programming
zbMATH Keywords: minimum mean cycle cancelling
zbMATH Keywords: multicommodity flow
zbMATH Keywords: message routing
zbMATH Keywords: telecommunication networks
MaRDI profile type: Publication
cites work: Q3056948
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Q3960718
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Parametric shortest path algorithms with an application to cyclic staffing
cites work: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
cites work: Q5183247
cites work: A new proximal decomposition algorithm for routing in telecommunication networks
cites work: A Survey of Algorithms for Convex Multicommodity Flow Problems
cites work: Convex Analysis
cites work: An Interior Point Method for Block Angular Optimization
cites work: Faster parametric shortest path and minimum‐balance algorithms
description: scientific article; zbMATH DE number 1423594