New polynomial-time cycle-canceling algorithms for minimum-cost flows.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 53, doi. 10.1002/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2000 AND VI 36 AND IP 1
Results: 7
1
2
The cardinality-constrained shortest path problem in 2-graphs.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 1, doi. 10.1002/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B
- By:
- Publication type:
- Article
3
Minimizing the complexity of an activity network.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 47, doi. 10.1002/1097-0037(200008)36:1<47::AID-NET5>3.0.CO;2-Q
- By:
- Publication type:
- Article
4
On the cycle polytope of a directed graph.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 34, doi. 10.1002/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2
- By:
- Publication type:
- Article
5
Constrained length connectivity and survivable networks.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 17, doi. 10.1002/1097-0037(200008)36:1<17::AID-NET3>3.0.CO;2-Z
- By:
- Publication type:
- Article
6
Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 64, doi. 10.1002/1097-0037(200008)36:1<64::AID-NET7>3.0.CO;2-R
- By:
- Publication type:
- Article
7
A characterization of the two-commodity network design problem.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 9, doi. 10.1002/1097-0037(200008)36:1<9::AID-NET2>3.0.CO;2-L
- By:
- Publication type:
- Article