SCOPUS 정보 검색 플랫폼

Volumn 27, Issue 2, 2002, Pages 372-383

Node-capacitated ring routing

Author keywords

Half integral flow; Multicommodity flow; Ring routing

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

MULTICOMMODITY FLOW PROBLEM; NODE CAPACITATED RING ROUTING PROBLEM; POLYNOMIAL ALGORITHM;

OPERATIONS RESEARCH;

EID: 0036577325 PISSN: 0364765X EISSN: None Source Type: Journal
DOI: 10.1287/moor.27.2.372.323 Document Type: Article

Times cited : (7)

References (7)

1
- 84957946170
- Princeton University Press, Princeton, NJ
- (1962) Flows in Networks
- Ford, L.R.¹ Fulkerson, D.R.²

2
- 0001002826
- Edge-disjoint paths in planar graphs
- (1985) J. Combinatorial Theory Ser. B , vol.39 , pp. 164-178
- Frank, A.¹

3
- 0001745044
- On an extension of the maximum-flow minimum cut theorem to multicommodity flows
- (1971) J. Oper. Res. Soc. Japan , vol.13 , Issue.3 , pp. 129-135
- Iri, M.¹

4
- 84959765508
- A minimax relation for directed graphs
- (1978) J. London Math. Soc. , vol.17 , Issue.2 , pp. 369-374
- Lucchesi, C.L.¹ Younger, D.H.²

5
- 0015095649
- On feasibility conditions of multicommodity flows in networks
- (1971) IEEE Trans. Circuit Theory , vol.18 , pp. 425-429
- Onaga, K.¹ Kakusho, O.²

6
- 0000800781
- Multicommodity flows in planar graphs
- (1981) J. Combinatorial Theory Ser. B , vol.31 , pp. 75-81
- Okamura, K.¹ Seymour, P.D.²

7
- 0001904667
- The ring loading problem
- (1998) SIAM J. Discrete Math. , vol.11 , Issue.1 , pp. 1-14
- Schrijver, A.¹ Seymour, P.D.² Winkler, P.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.