Back to search

A Survey of Algorithms for Convex Multicommodity Flow Problems

Data up to Jan 2025

Published2000
Citations154
References71

Total Citations Per Year

Abstract

References (71)

Convex Analysis

1970 • 9,645 citations

Network Flows: Theory, Algorithms, and Applications.

1994 • 8,288 citations

Data networks

1987 • 5,740 citations

Flows in networks

1962 • 4,199 citations

Monotone Operators and the Proximal Point Algorithm

1976 • 3,500 citations

Network flows: Theory, algorithms and applications

1994 • 2,954 citations

An algorithm for quadratic programming

1956 • 2,939 citations

The Cutting-Plane Method for Solving Convex Programs

1960 • 1,530 citations

Optimization Theory for Large Systems

1970 • 1,265 citations

Parallel and distributed computation

1989 • 1,225 citations

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

1976 • 1,160 citations

Optimization Theory of Large Systems

1971 • 1,129 citations

Nonlinear Programming: A Unified Approach.

1970 • 1,066 citations

The Traffic Assignment Problem: Models and Methods

1994 • 1,046 citations

Flows in Networks

1963 • 806 citations

An efficient approach to solving the road network equilibrium traffic assignment problem

1975 • 760 citations

The Decomposition Algorithm for Linear Programs

1961 • 754 citations

Communication Nets: Stochastic Message Flow and Delay

1966 • 639 citations

Projected Newton Methods for Optimization Problems with Simple Constraints

1982 • 625 citations

The flow deviation method: An approach to store‐and‐forward communication network design

1973 • 566 citations

Networks synthesis and optimum network design problems: Models, solution methods and applications

1989 • 430 citations

Multi-Commodity Network Flows

1963 • 385 citations

A method of conjugate subgradients for minimizing nondifferentiable functions

1975 • 380 citations

Finding minimum-cost circulations by canceling negative cycles

1989 • 342 citations

Newton's method for convex programming and Tchebycheff approximation

1959 • 335 citations

Multicommodity network flows—A survey

1978 • 311 citations

Graphes et algorithmes

1995 • 303 citations

Splitting methods for monotone operators with applications to parallel optimization

1989 • 272 citations

Routing Techniques Used in Computer Communication Networks

1980 • 241 citations

A Survey of Linear Cost Multicommodity Network Flows

1978 • 223 citations

Optimal Routing in a Packet-Switched Computer Network

1974 • 208 citations

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

1992 • 203 citations

Partial inverse of a monotone operator

1983 • 194 citations

Graphes et algorithmes

1981 • 187 citations

Large scale optimization : state of the art

1994 • 170 citations

Applications of the method of partial inverses to convex programming: Decomposition

1985 • 156 citations

Parallel alternating direction multiplier decomposition of convex programs

1994 • 151 citations

Simplicial decomposition in nonlinear programming algorithms

1977 • 146 citations

A polynomial newton method for linear programming

1986 • 138 citations

Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs

1985 • 130 citations

Projected Newton methods and optimization of multicommodity flows

1983 • 125 citations

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

1997 • 121 citations

Relaxation Methods for Network Flow Problems with Convex Arc Costs

1987 • 106 citations

Multicommodity network flows: The impact of formulation on decomposition

1993 • 106 citations

Mathematical programming algorithms for large scale network equilibrium and network design problems.

1973 • 95 citations

Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach

1990 • 91 citations

Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

1997 • 88 citations

An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem

1987 • 85 citations

A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem

1993 • 71 citations

A Class of Decentralized Routing Algorithms Using Relaxation

1977 • 69 citations

An Interior Point Method for Block Angular Optimization

1991 • 66 citations

Relaxation methods for problems with strictly convex separable costs and linear constraints

1987 • 62 citations

Proximal Decomposition on the Graph of a Maximal Monotone Operator

1995 • 57 citations

The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks

1976 • 52 citations

A new proximal decomposition algorithm for routing in telecommunication networks

1998 • 46 citations

Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems

1991 • 44 citations

Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm

1992 • 37 citations

Untitled

1998 • 37 citations

An Efficient Implementation of MPI

1994 • 34 citations

Proximal decomposition for multicommodity flow problems with convex costs

1994 • 25 citations

Using an interior point method for the master problem in a decomposition approach

1997 • 25 citations

AN EFFICIENT IMPLEMENTATION OF THE "PARTAN" VARIANT OF THE LINEAR APPROXIMATION METHOD FOR THE NETWORK EQUILIBRIUM PROBLEM

1985 • 21 citations

A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

2000 • 17 citations

A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS

1984 • 17 citations

Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

1994 • 15 citations

Studies on Multicommodity Flows in Directed Networks

1988 • 12 citations

Applications and numerical convergence of the partial inverse method

2006 • 11 citations

Contribution a l'optimisation de flots dans les reseaux : un multiprocesseur experimental pour l'etude des iterations asynchrones

1987 • 6 citations

Decomposition proximale des problemes de multiflot a critere convexe. Application aux problemes de routage dans les reseaux de communication

1995 • 5 citations

PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS

1994 • 5 citations

A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗

1993 • 1 citations

Cited By (0)

Loading...