Co ents and criticisms from interested readers are cordially invited. A3STRACT This exposition presents a state—of—the—art survey of models and algorithms for the convex cost network flow problem
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sou...
This paper evaluates an algorithm for solving network flow optimization problems with quadratic cost...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an addition...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
There are many problems related to design a networks. Among them, the message routing problem plays ...
Includes bibliographical references (p. 16-18).Supported by the NSF. CCR-9103804 9300494-DMIby Dimit...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
We describe a new algorithm for solving separable quadratic cost network programming problems and co...
International audienceMulticommodity flow networks are known to be much harder than single-commodity...
Caption title.Includes bibliographical references (p. 19-21).Supported by the NSF. CCR-9103804 93004...
SIGLEBibliothek Weltwirtschaft Kiel C117,372 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sou...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sou...
This paper evaluates an algorithm for solving network flow optimization problems with quadratic cost...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an addition...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
We review and analyze nonlinear programming approaches to model-ing and solving certain flow problem...
There are many problems related to design a networks. Among them, the message routing problem plays ...
Includes bibliographical references (p. 16-18).Supported by the NSF. CCR-9103804 9300494-DMIby Dimit...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
We describe a new algorithm for solving separable quadratic cost network programming problems and co...
International audienceMulticommodity flow networks are known to be much harder than single-commodity...
Caption title.Includes bibliographical references (p. 19-21).Supported by the NSF. CCR-9103804 93004...
SIGLEBibliothek Weltwirtschaft Kiel C117,372 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sou...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sou...
This paper evaluates an algorithm for solving network flow optimization problems with quadratic cost...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...