Bibliography: p. 17-18."February 1984""NSF-ECS-8217668" "ONR/N00014-75-C-1183"Dimitri P. Bertsekas, Bob Gendron, Wei K. Tsai
We describe the development of a data-level, massively parallel software system for the solution of ...
Caption title.Includes bibliographical references.Supported in part by ARPA under Grant ONR/N00014-7...
We propose two flow control algorithms for networks with multiple paths between each source-destinat...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
Bibliography: p. 26-28."August 1981."Partial support provided by the National Science Foundation Gra...
In this paper, we present a simple and fast distributed algorithm for approximately solving the mini...
"10-257-77."Bibliography: p. 68-69.Supported by the U.S. Department of Transportation under contract...
AbstractAll previously known algorithms for solving the multicommodity flow problem with capacities ...
In this paper, we describe a very simple (1 + ")- approximation algorithm for the multicommodi...
Minimum-cost multicommodity flow problem is one of the classical optimization problems that arises i...
Abstract. In this paper, we establish max-flow min-cut theorems for several important classes of mul...
This chapter is devoted to modeling and optimization techniques applicable to communication network ...
Extended graph and network is a powerful mathematical tool applied in many fields such as transporta...
This paper looks at several methods for solving network flow problems. The first chapter gives a bri...
Designing and optimizing different flows in networks is a relevant problem in many contexts. While a...
We describe the development of a data-level, massively parallel software system for the solution of ...
Caption title.Includes bibliographical references.Supported in part by ARPA under Grant ONR/N00014-7...
We propose two flow control algorithms for networks with multiple paths between each source-destinat...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
Bibliography: p. 26-28."August 1981."Partial support provided by the National Science Foundation Gra...
In this paper, we present a simple and fast distributed algorithm for approximately solving the mini...
"10-257-77."Bibliography: p. 68-69.Supported by the U.S. Department of Transportation under contract...
AbstractAll previously known algorithms for solving the multicommodity flow problem with capacities ...
In this paper, we describe a very simple (1 + ")- approximation algorithm for the multicommodi...
Minimum-cost multicommodity flow problem is one of the classical optimization problems that arises i...
Abstract. In this paper, we establish max-flow min-cut theorems for several important classes of mul...
This chapter is devoted to modeling and optimization techniques applicable to communication network ...
Extended graph and network is a powerful mathematical tool applied in many fields such as transporta...
This paper looks at several methods for solving network flow problems. The first chapter gives a bri...
Designing and optimizing different flows in networks is a relevant problem in many contexts. While a...
We describe the development of a data-level, massively parallel software system for the solution of ...
Caption title.Includes bibliographical references.Supported in part by ARPA under Grant ONR/N00014-7...
We propose two flow control algorithms for networks with multiple paths between each source-destinat...
DOI
Add to ORKG