Includes bibliographical references.Supported in part by the Presidential Young Investigator Grant of the National Science Foundation. 8451517-ECS Supported in part by the Air Force Office of Scientific Research. AFOSR-88-0088 Supported in part by grants from Analog Devices, Apple Computers, Inc. and Prime Computer.James B. Orlin
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. ...
Bibliography: p. 11.Supported in part by a grant from the National Science Foundation Presidential Y...
Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88Includes bibliographical refe...
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a maximum flow o...
An efficient polynomial time algorithm forsolving minimum cost flow problems has been proposedin thi...
The minimum-cost flow problem is the following: given a network with n vertices and m edges, find a ...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
AbstractWe present two new strongly polynomial algorithms for the minimum cost network flow problem ...
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
We consider the quickest flow problem in dynamic networks with a single source s and a single sink t...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. ...
Bibliography: p. 11.Supported in part by a grant from the National Science Foundation Presidential Y...
Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88Includes bibliographical refe...
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a maximum flow o...
An efficient polynomial time algorithm forsolving minimum cost flow problems has been proposedin thi...
The minimum-cost flow problem is the following: given a network with n vertices and m edges, find a ...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
AbstractWe present two new strongly polynomial algorithms for the minimum cost network flow problem ...
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
We consider the quickest flow problem in dynamic networks with a single source s and a single sink t...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. ...
Add to ORKG