On the Core of Cost Allocation Games Defined on Location Problems
暂无分享,去创建一个
[1] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[2] Daniel Granot. The Role of Cost Allocation in Locational Models , 1987, Oper. Res..
[3] Timothy J. Lowe,et al. Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network , 1982, Oper. Res..
[4] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[5] A. Tamir. A Class of Balanced Matrices Arising from Location Problems , 1983 .
[6] Arie Tamir,et al. Totally balanced and totally unimodular matrices defined by center location problems , 1987, Discret. Appl. Math..
[7] Jean-Pierre Aubin,et al. Cooperative Fuzzy Games , 1981, Math. Oper. Res..
[8] D. R. Fulkerson,et al. On balanced matrices , 1974 .
[9] Guillermo Owen,et al. On the core of linear production games , 1975, Math. Program..
[10] R. Chandrasekaran,et al. Polynomially bounded algorithms for locatingp-centers on a tree , 1978, Math. Program..