Networks synthesis and optimum network design problems: Models, solution methods and applications
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..
[3] J. Billheimer,et al. Network Design with Fixed and Variable Cost Elements , 1973 .
[4] Jan Karel Lenstra,et al. The complexity of the network design problem , 1978, Networks.
[5] Hoang Hai Hoc. A Computational Approach to the Selection of an Optimal Network , 1973 .
[6] R. Prim. Shortest connection networks and some generalizations , 1957 .
[7] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .
[8] Rod M. Burstall,et al. Computer Design of Electricity Supply Networks by a Heuristic Method , 1966, Comput. J..
[9] Nicos Christofides,et al. The Loading Problem , 1971 .
[10] Larry J. LeBlanc,et al. An Algorithm for the Discrete Network Design Problem , 1975 .
[11] P. Brooker,et al. Optimal expansion of an existing network , 1974, Math. Program..
[12] T. C. Hu,et al. Synthesis of a Communication Network , 1964 .
[13] M. Karnaugh. A New Class of Algorithms for Multipoint Network Optimization , 1976, IEEE Trans. Commun..
[14] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[15] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[16] Sang Nguyen. Book of Interest , 1975 .
[17] Michel Minoux. Planification a court et a moyen terme d’un réseau de télécommunications , 1974 .
[18] Wushow Chou,et al. Topological optimization of computer networks , 1972 .
[19] Giorgio Gallo,et al. Concave cost minimization on networks , 1979 .
[20] Giorgio Gallo,et al. An algorithm for the min concave cost flow problem , 1980 .
[21] Mario Gerla,et al. On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..
[22] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[23] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[24] K. Mani Chandy,et al. The Design or Multipoint Linkages in a Teleprocessing Tree Network , 1972, IEEE Transactions on Computers.
[25] Bezalel Gavish,et al. Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.
[26] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[27] Jeff L. Kennington,et al. A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..
[28] M. Goldstein,et al. The One-Terminal TELPAK Problem , 1971, Oper. Res..
[29] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.
[30] Michael Florian,et al. An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem , 1971 .
[31] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[32] M. Malek-Zavarei,et al. On the fixed cost flow problem , 1972 .
[33] T. C. Hu,et al. An Application of Generalized Linear Programming to Network Flows , 1962 .
[34] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[35] Norman Zadeh,et al. On building minimum cost communication networks , 1973, Networks.
[36] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[37] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[38] Aaron Kershenbaum,et al. Centralized teleprocessing network design , 1976, Networks.
[39] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[40] M. Minoux. Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .
[41] Hoang Hai Hoc,et al. Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .
[42] Arjang A. Assad,et al. Multicommodity network flows - A survey , 1978, Networks.
[43] Michael Florian,et al. Exact and approximate algorithms for optimal network design , 1979, Networks.
[44] M. Ferguson,et al. Topological Design of Multipoint Teleprocessing Networks , 1974, IEEE Trans. Commun..
[45] T. C. Hu. Optimum Communication Spanning Trees , 1974, SIAM J. Comput..
[46] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .
[47] Richard T. Wong,et al. Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.
[48] T. Ridley. AN INVESTMENT POLICY TO REDUCE THE TRAVEL TIME IN A TRANSPORTATION NETWORK , 1968 .
[49] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[50] M. Minoux,et al. Multiflots de coût minimal avec fonctions de coût concaves , 1976 .
[51] A. Scott. The optimal network problem: Some computational procedures , 1969 .
[52] I. T. Frisch,et al. The design of large-scale networks , 1972 .
[53] R. Weischedel,et al. Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .
[54] George B. Dantzig,et al. Formulating and solving the network design problem by decomposition , 1979 .
[55] Kurt Spielberg,et al. Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..
[56] Leon Cooper,et al. The Transportation-Location Problem , 1972, Oper. Res..
[57] John E. Beasley. An algorithm for the steiner problem in graphs , 1984, Networks.
[58] H. Crowder,et al. Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .
[59] A. M. Geoffrion. Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .
[60] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[61] Giorgio Gallo,et al. Lower planes for the network design problem , 1983, Networks.
[62] A. Kershenbaum,et al. Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design , 1980, IEEE Trans. Commun..
[63] Roberto D. Galvão,et al. A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..
[64] Lalit R. Bahl,et al. Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals , 1978, IEEE Transactions on Computers.
[65] A. D. Pearman. HEURISTIC APPROACHES TO ROAD NETWORK OPTIMIZATION , 1974 .
[66] Norman Zadeh,et al. On building minimum cost communication networks over time , 1974, Networks.
[67] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[68] Larry J. LeBlanc,et al. An efficient dual approach to the urban road network design problem , 1979 .
[69] K. Mani Chandy,et al. The Capacitated Minimum Spanning Tree , 1973, Networks.
[70] M. Minoux,et al. Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .
[71] T. B. Boffey,et al. Solving the optimal network problem , 1979 .
[72] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.
[73] Christos H. Papadimitriou,et al. The complexity of the capacitated tree problem , 1978, Networks.
[74] Aaron Kershenbaum,et al. Computing capacitated minimal spanning trees efficiently , 1974, Networks.
[75] Paul Gray,et al. Technical Note - Exact Solution of the Fixed-Charge Transportation Problem , 1971, Oper. Res..
[76] M. Balinski. Fixed‐cost transportation problems , 1961 .
[77] Bernard Yaged,et al. Minimum cost routing for static network models , 1971, Networks.
[78] Peter A. Steenbrink,et al. Optimization of Transport Networks , 1974 .
[79] R. Tarjan. A simple version of Karzanov's blocking flow algorithm , 1984 .
[80] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[81] A. D. Pearman. The structure of the solution set to network optimisation problems , 1979 .
[82] L. R. Esau,et al. On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..
[83] D. I. Steinberg,et al. The fixed charge problem , 1970 .
[84] K. Mani Chandy,et al. Computational Complexity of Network Design Algorithms , 1977, IFIP Congress.