Hub network games

Networks

Volumn 31, Issue 4, 1998, Pages 293-302

  Skorin Kapov, Darko ^a  

^a Financial Technologies International   (United States)

Author keywords

Cooperative games; Cost allocation; Hub location; Integer programming; Linear programming

Indexed keywords

EID: 0039394400     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199807)31:4<293::AID-NET9>3.0.CO;2-8     Document Type: Article

References (26)

1. J. F. Campbell, Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72 (1994) 387-405.
2. J. F. Campbell, A survey of network hub location. Stud. Locational Anal. (6) (1994) 31-49.
3. D. Granot, A generalized linear production model: A unifying model. Math. Program. 34 (1986) 212-223.
4. D. Granot, The role of cost allocation in locational models. Oper. Res. 35 (1987) 234-248.
5. D. Granot and F. Granot, On some network flow games. Math. Oper. Res. 17 (1992) 792-841.
6. D. Granot and M. Hojati, On the cost allocation in telecommunication networks. Networks 20 (1990) 209-229.
7. D. Granot and G. Huberman, Minimum cost spanning tree games. Math. Program. 21 (1981) 1-18.
8. D. Granot and G. Huberman, On the core and nucleolus of M.C.S.T. games. Math. Program. 29 (1984) 323-347.
9. J. G. Klincewicz, Heuristics for the p-hub location problem. Eur. J. Oper. Res. 53 (1991) 25-37.
10. J. G. Klincewicz, Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann. Oper. Res. 40 (1992) 283-302.
11. J. Kuipers, V. Feltkamp, and S. H. Tijs, Vertex weighted Steiner tree games. Technical paper, Department of Econometrics and CentER, Tilburg, The Netherlands (1996).
12. M. Maschler, B. Peleg, and L. S. Shapley, Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. 4 (1979) 303-338.
13. M. E. O'Kelly, A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32 (1987) 393-404.
14. M. E. O'Kelly, Hub facility location with fixed cost. Pap. Region. Sci. 71 (1992) 293-306.
15. M. O'Kelly, D. Skorin-Kapov, and J. Skorin-Kapov, Lower bounds for the hub location problem. Mgmt. Sci. 41 (1995) 713-728.
16. G. Owen, On the core of linear production games. Math. Program. 9 (1975) 358-370.
17. J. A. M. Potters, I. J. Curiel, and S. H. Tijs, Traveling salesman games. Math. Program. 53 (1987) 199-211.
18. D. Schmeidler, The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17 (1969) 1163-1170.
19. W. W. Sharkey, Cores of games with fixed costs and shared facilities. Int. Econ. Rev. 30 (1990) 245-262.
20. W. W. Sharkey, Networks Models in Economics. Handbooks in OR&MS, (M. O. Ball, T. L. Magnanti, C. L. Monina, and G. L. Newhauser, Eds.). Elsevier 8 (1995) Chap. 9.
21. D. Skorin-Kapov, On a cost allocation problem arising from a capacitated concentrator covering problem. Oper. Res. Lett. 13 (1993) 315-323.
22. D. Skorin-Kapov, On the core of the minimum Steiner tree game in networks. Ann. Oper. Res. 57 (1995) 233-249.
23. D. Skorin-Kapov and H. F. Beltran, An efficient characterization of cost allocation solutions associated with capacitated network design problems. Telecommun. Syst. 3 (1994) 91-107.
24. D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. 73 (1994) 502-509.
25. D. Skorin-Kapov, J. Skorin-Kapov, and M. O'Kelly, Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94 (1996) 582-593.
26. J. Sohn and S. Park, The single allocation problem in the interacting three-hub location network. Technical Report, Dept. of Industrial Engineering, Korean Advanced Institute of Science and Technology, Taejon 305-701, South Korea (1997).