Infrastructure development for conversion to environmentally friendly fuel
暂无分享,去创建一个
[1] M. I. Henig. The shortest path problem with two objective functions , 1986 .
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[4] Hassan Abdulaziz,et al. Environment and Planning , 1969 .
[5] Arthur J. Swersey,et al. An integer programming model for locating vehicle emissions testing stations , 1995 .
[6] S. Hakimi. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .
[7] R. Church,et al. The maximal covering location problem , 1974 .
[8] Richard L. Church,et al. The maximal covering location problem , 1974 .
[9] S. Datta,et al. An application of O.R. in micro-level planning in India , 1993, Comput. Oper. Res..
[10] Jack Brimberg,et al. MULTI-FACILITY LOCATION USING A MAXIMIN CRITERION AND RECTANGULAR DISTANCES. , 1994 .
[11] John N. Hooker,et al. Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..
[12] Charles ReVelle,et al. Review, extension and prediction in emergency service siting models , 1989 .
[13] J. Current,et al. Capacitated Covering Models , 1988 .
[14] H. Pirkul,et al. The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .
[15] J. Current,et al. The Minimum‐Covering/Shortest‐Path Problem* , 1988 .
[16] J. Current,et al. The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .
[17] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .