Add to ORKG"10-257-77."Bibliography: p. 68-69.Supported by the U.S. Department of Transportation under contract. DOT-TSC-1058by Arjang A. Assad
The traditional multi-commodity flow problem assumes a given flow network in which multiple commodi...
Abstract: This paper presents a specialized code for solving the linear and non-linear multicommodit...
Flow variation over time is an important feature in network flow problems arising in various applica...
tation under Contract DOT-TSC-1058. rr This paper reports computational results with two algorithms ...
[[abstract]]Previous research on the multicommodity minimum cost flow problem(MMCFP) fas assuned tha...
Bibliography: p. 17-18."February 1984""NSF-ECS-8217668" "ONR/N00014-75-C-1183"Dimitri P. Bertsekas, ...
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition metho...
International audienceMulticommodity flow networks are known to be much harder than single-commodity...
This paper discusses problems in the context of multicommodity network design where the additional c...
The triples formulation is a compact formulation of multicommodity network flow problems that provid...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
This chapter is devoted to modeling and optimization techniques applicable to communication network ...
Flow variation over time is an important feature in network flow problems arising in various applica...
We show that an $veps$-approximate solution of the cost-constrained $K$-commodity flow problem on an...
The traditional multi-commodity flow problem assumes a given flow network in which multiple commodi...
Abstract: This paper presents a specialized code for solving the linear and non-linear multicommodit...
Flow variation over time is an important feature in network flow problems arising in various applica...
tation under Contract DOT-TSC-1058. rr This paper reports computational results with two algorithms ...
[[abstract]]Previous research on the multicommodity minimum cost flow problem(MMCFP) fas assuned tha...
Bibliography: p. 17-18."February 1984""NSF-ECS-8217668" "ONR/N00014-75-C-1183"Dimitri P. Bertsekas, ...
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition metho...
International audienceMulticommodity flow networks are known to be much harder than single-commodity...
This paper discusses problems in the context of multicommodity network design where the additional c...
The triples formulation is a compact formulation of multicommodity network flow problems that provid...
Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization o...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
This chapter is devoted to modeling and optimization techniques applicable to communication network ...
Flow variation over time is an important feature in network flow problems arising in various applica...
We show that an $veps$-approximate solution of the cost-constrained $K$-commodity flow problem on an...
The traditional multi-commodity flow problem assumes a given flow network in which multiple commodi...
Abstract: This paper presents a specialized code for solving the linear and non-linear multicommodit...
Flow variation over time is an important feature in network flow problems arising in various applica...