SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 301-315

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring

(2) Shepherd, Bruce a Zhang, Lisa a

a LUCENT TECHNOLOGIES (United States)

Author keywords

Bandwidth allocation; Linear programming; Multicommodity flow; Ring networks; Virtual private network (VPN)

Indexed keywords

EID: 0035877327 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(00)00252-3 Document Type: Article

Times cited : (12)

References (14)

1
- 0347125924
- Ring networks to the rescue
- Clendening S.J. Ring networks to the rescue. Telephone Engnr. Manage. 1992;50-55.
- (1992) Telephone Engnr. Manage. , pp. 50-55
- Clendening, S.J.¹

2
- 0004054088
- New York: Wiley
- Cook W., Cunningham W., Pulleyblank W., Schrijver A. Combinatorial Optimization. 1998;Wiley, New York.
- (1998) Combinatorial Optimization
- Cook, W.¹ Cunningham, W.² Pulleyblank, W.³ Schrijver, A.⁴

3
- 0001259317
- An optimization problem related to balancing loads on SONET rings
- Cosares S., Saniee I. An optimization problem related to balancing loads on SONET rings, Telecomm. Systems. 3. 1994:165-181.
- (1994) Telecomm. Systems , vol.3 , pp. 165-181
- Cosares, S.¹ Saniee, I.²

4
- 0001261128
- Maximal flow through a network
- Ford L.R. Jr., Fulkerson D.R. Maximal flow through a network. Canad. J. Math. 8:1956;399-404.
- (1956) Canad. J. Math. , vol.8 , pp. 399-404
- Ford Jr., L.R.¹ Fulkerson, D.R.²

5
- 0001002826
- Edge-disjoint paths in planar graphs
- Frank A. Edge-disjoint paths in planar graphs. J. Combin. Theory B. 39:1985;164-178.
- (1985) J. Combin. Theory B , vol.39 , pp. 164-178
- Frank, A.¹

6
- 0347756266
- submitted for publication
- A. Frank, B. Shepherd, V. Tandon, Z. Vegh, Node-capacitated routing in a ring network, 1998, submitted for publication.
- (1998) Node-capacitated Routing in a Ring Network
- Frank, A.¹ Shepherd, B.² Tandon, V.³ Vegh, Z.⁴

7
- 0024755290
- Finding minimum-cost circulations by canceling negative cycles
- Goldberg A.V., Tarjan R.E. Finding minimum-cost circulations by canceling negative cycles. J ACM. 36:1989;873-886.
- (1989) J ACM , vol.36 , pp. 873-886
- Goldberg, A.V.¹ Tarjan, R.E.²

8
- 0000703001
- Multi-commodity network flows
- Hu T.C. Multi-commodity network flows. Oper. Res. 11:1963;344-360.
- (1963) Oper. Res. , vol.11 , pp. 344-360
- Hu, T.C.¹

9
- 0031084627
- A polynomial time approximation scheme for the SONET ring loading problem
- Khanna S. A polynomial time approximation scheme for the SONET ring loading problem. Bell Labs Tech. J. Spring. 1997;36-41.
- (1997) Bell Labs Tech. J. Spring , pp. 36-41
- Khanna, S.¹

10
- 0003973316
- (Eds.) Berlin: Springer
- Korte B., Lovász L., Prömel H.J., Schrijver (Eds.) A. Paths, Flows and VLSI-Layout. 1990;Springer, Berlin.
- (1990) Paths, Flows and VLSI-Layout
- Korte, B.¹ Lovász, L.² Prömel, H.J.³ Schrijver, A.⁴

11
- 0032631694
- Virtual private networks: Joint resource allocation and routing design
- April
- D. Mitra, J.A. Morrison, K.G. Ramakrishnan, Virtual private networks: joint resource allocation and routing design, Proceedings of IEEE INFOCOM 99, April, 1999, pp. 480-490.
- (1999) Proceedings of IEEE INFOCOM 99 , pp. 480-490
- Mitra, D.¹ Morrison, J.A.² Ramakrishnan, K.G.³

12
- 0000800781
- Multicommodity flows in planar graphs
- Okamura H., Seymour P. Multicommodity flows in planar graphs. J. Combin. Theory B. 31:1981;75-81.
- (1981) J. Combin. Theory B , vol.31 , pp. 75-81
- Okamura, H.¹ Seymour, P.²

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

14
- 0032654630
- A polynomial combinatorial algorithm for generalized minimum cost flow
- K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, Proceedings of STOC '99, 1999, pp. 11-18.
- (1999) Proceedings of STOC '99 , pp. 11-18
- Wayne, K.¹

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