SCOPUS 정보 검색 플랫폼

Volumn 44, Issue 4, 2004, Pages 297-301

A network flow approach to cost allocation for rooted trees

Author keywords

Convex game; Core; Egalitarian allocation; Nucleolus; Tree network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST ACCOUNTING; MAINTENANCE; PROBLEM SOLVING; TREES (MATHEMATICS);

CONVEX GAME; CORE; EGALITARIAN ALLOCATION; NUCLEOLUS; TREE NETWORK;

PIPELINES;

EID: 9744249504 PISSN: 00283045 EISSN: None Source Type: Journal
DOI: 10.1002/net.20040 Document Type: Article

Times cited : (5)

References (13)

1
- 0003415652
- Addison-Wesley, Reading, MA
- A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974.
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 0000310904
- A concept of egalitarianism under participation constraints
- B. Dutta and D. Ray, A concept of egalitarianism under participation constraints, Econometrica 57 (1989), 615-635.
- (1989) Econometrica , vol.57 , pp. 615-635
- Dutta, B.¹ Ray, D.²

3
- 0039687324
- Lexicographically optimal base of a polymatroid with respect to a weight vector
- S. Fujishige, Lexicographically optimal base of a polymatroid with respect to a weight vector, Math Oper Res 5 (1980), 186-196.
- (1980) Math Oper Res , vol.5 , pp. 186-196
- Fujishige, S.¹

4
- 0004289518
- North-Holland, Amsterdam
- S. Fujishige, Submodular functions and optimization, North-Holland, Amsterdam, 1991.
- (1991) Submodular Functions and Optimization
- Fujishige, S.¹

5
- 0018925214
- Applications of efficient mergeable heaps for optimization problems on trees
- Z. Galil, Applications of efficient mergeable heaps for optimization problems on trees, Acta Informat 13 (1980), 53-58.
- (1980) Acta Informat , vol.13 , pp. 53-58
- Galil, Z.¹

6
- 0032257508
- Spanning network games
- D. Granot and M. Maschler, Spanning network games, Int J Game Theory 27 (1998), 467-500.
- (1998) Int J Game Theory , vol.27 , pp. 467-500
- Granot, D.¹ Maschler, M.²

7
- 0030553803
- The kernel/nucleolus of a standard tree game
- D. Granot, M. Maschler, G. Owen, and W.R. Zhu, The kernel/nucleolus of a standard tree game, Int J Game Theory 25 (1996), 219-244.
- (1996) Int J Game Theory , vol.25 , pp. 219-244
- Granot, D.¹ Maschler, M.² Owen, G.³ Zhu, W.R.⁴

8
- 0036873922
- Cost allocation for a tree network with heterogeneous customers
- D. Granot, J. Kuipers, and S. Chopra, Cost allocation for a tree network with heterogeneous customers, Math Oper Res 27 (2002), 647-661.
- (2002) Math Oper Res , vol.27 , pp. 647-661
- Granot, D.¹ Kuipers, J.² Chopra, S.³

9
- 0001687035
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- D. Hochbaum and S.-P. Hong, About strongly polynomial time algorithms for quadratic optimization over submodular constraints, Math Program 69 (1995), 269-309.
- (1995) Math Program , vol.69 , pp. 269-309
- Hochbaum, D.¹ Hong, S.-P.²

10
- 18044389680
- Sharing the cost of a network: Core and core allocations
- M. Koster, E. Molina, Y. Sprumont, and S.H. Tijs, Sharing the cost of a network: Core and core allocations, Int J Game Theory 30 (2001), 567-599.
- (2001) Int J Game Theory , vol.30 , pp. 567-599
- Koster, M.¹ Molina, E.² Sprumont, Y.³ Tijs, S.H.⁴

11
- 0003104050
- Optimal flows in networks with multiple sources and sinks
- N. Megiddo, Optimal flows in networks with multiple sources and sinks, Math Program 7 (1974), 97-107.
- (1974) Math Program , vol.7 , pp. 97-107
- Megiddo, N.¹

12
- 0000928347
- Computational complexity of the game theory approach to cost allocation for a tree
- N. Megiddo, Computational complexity of the game theory approach to cost allocation for a tree, Math Oper Res 3 (1978), 189-196.
- (1978) Math Oper Res , vol.3 , pp. 189-196
- Megiddo, N.¹

13
- 34250468778
- Cores of convex games
- L.S. Shapley, Cores of convex games, Int J Game Theory 1 (1971), 11-26.
- (1971) Int J Game Theory , vol.1 , pp. 11-26
- Shapley, L.S.¹

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