#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1996

2002

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Donald Goldfarb, Zhiying Jin, James B. Orlin
- Math. Oper. Res.
- 1997

This paper presents two new combinatorial algorithms for the generalized circulation problem. After an initial step in which all ow-generating cycles are canceled and excesses are created, both algorithms bring these excesses to the sink via highest-gain augmenting paths. Scaling is applied to the xed amount of ow that the algorithms attempt to send to the… (More)

- Donald Goldfarb, Zhiying Jin
- Math. Oper. Res.
- 1996

- Ronald D. Armstrong, Zhiying Jin
- Math. Program.
- 1997

This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos' (1993) dual network simplex… (More)

- Donald Goldfarb, Zhiying Jin, Yiqing Lin
- Math. Program.
- 2002

- Donald Goldfarb, Zhiying Jin
- Operations Research
- 1999

- Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin
- Math. Program.
- 1998

- Donald Goldfarb, Zhiying Jin
- Oper. Res. Lett.
- 1999

- Ronald D. Armstrong, Zhiying Jin
- Discrete Applied Mathematics
- 1996

This paper presents two new combinatorial algorithms for the generalized circulation problem. After an initial step in which all flow-generating cycles are canceled and excesses are created, both algorithms bring these excesses to the sink via highest-gain augmenting paths. Scaling is applied to the fixed amount of flow that the algorithms attempt to send… (More)

- ‹
- 1
- ›