Networks synthesis and optimum network design problems: Models, solution methods and applications
Tóm tắt
Từ khóa
Tài liệu tham khảo
D.ArdittiandM.Minoux Un algorithme de determination de partition utilisant la dualité lagrangienne. Actes regroupés des journées de classification de Toulouse (mai1980) et nancy (Juin 1981). I.C. Lerman Ed.
O.BildeandJ.Krarup Bestemmels af optimal beliggenhed of Produktionssteder. Research report IMSOR Danmarks Tekniske Hojskole (1967).
R. R.BoorstynandH.Frank Large scale network topological optimization.IEEE Trans. Comm.COM‐25(1977)29–47.
Burstall R. M., 1967, Tree searching methods with an application to a network design problem, Machine Intelligence, 1, 65
A.ClausandN.Maculan Une nouvelle formulation du problème de Steiner sur un graphe. Prépublication #280 Centre de Recherche sur les Transports. Université de Montréal.
Dinic E. A., 1970, Algorithm for solution of a problem of maximum flow on a network with power estimation, Soviet math Dokl., 11, 1277
D.EliasandM. J.Ferguson Topological design of multipoint teleprocessing networks.IEEE Trans. Comm. COM‐22(1974)1753–1762.
Ellis L. W., 1975, La loi des volumes économiques appliquée aud Télécommunications, Rev. Telecom., 1, 4
Fletcher R., 1974, Numerical Methods for Constrainted Optimization, 219
Garey M. R., 1979, Computers and Intractability: A guide to the Theory of NP‐Completeness
B.Gavish Augmented lagrangean based algorithms for centralized network design. Working paper QM 8321 The Graduate School of Management The University of Rochester NY14627(1984).
M.GerlaandL.Kleinrock On the topological design of distributed computer networks.IEEE Trans. Comm.COM‐25(1977)48–60.
Gondran M., 1979, Graphes et algorithmes
P.Hansen The optimum rented lines network problem. Symposium “Operations Research in Telecommunications” held at Rutgers University Rutgers Center for Operations Research November 30 1984.
Karzanov A. V., 1974, Determining the maximal flow in a network by the method of perflows, Soviet Math. Dokl., 15, 434
H.Kobayashi Communication network design and control algorithms—a survey. Research Report RC 9233 IBM Thomas J. Watson Research Centre (1982).
Los M., 1980, Combinatorial programming, statistical optimization and the optimal transportation network problem, Trans. Res., 89
Magnanti T. L., 1983, Tailoring Benders decomposition for network design
T. L.MagnantiandR. T.Wong Accelerating Benders decomposition for network design. Discussion Paper C.O.R.E. Belgium (1977).
T. L.MagnantiandR. T.Wong A dual ascent approach to fixed charge network design problems. To appear.
P.Marcotte An analysis of heuristics for the network design problem. Publication #200 Centre de recherche sur les transports Université de Montréal (1982).
Minoux M., 1976, Optimization Techniques, 419
Minoux M., 1976, Multiflots de cut minimal avec fonctions de cot concaves, Annales des Télécommunications., 31, 77, 10.1007/BF02997589
Minoux M., 1977, Algorithmes gloutons et algorithmes gloutons accélérés pour la résolution des grands problémes combinatoires, Bull. Dir. Et. Rech. EDF, Série C, 1, 59
Minoux M., 1977, Accelerated greedy algorithms for maximizing submodular set functions, 234
Minoux M., 1974, Plantification è court et è moyen terme d'un réseau de Télécommunications, Annales des Télécommunications, 29, 509, 10.1007/BF02995852
Minoux M., 1983, Programmation Mathématique: théorie et algorithmes
M.Minoux Localisation optimale de concentrateurs dans un reseau téléinformatique. Unpublished report May (1984).
Minoux M., 1984, Mathematical Programming, 271
Minoux M., Network synthesis and dynamic network optimization” in Surveys in Combinational Optimization, Annals of Discrete Mathematics, 31, 283
Minoux M., 1981, Synthèse optimale d'un réseau de Télécommunications avec contraintes de sécurité, Annales des Télécommunications, 36, 211, 10.1007/BF02999753
Minoux M., 1981, Subgradient optimization and large scale programming: an application to network synthesis wiht security constraints, RAIRO, 15, 185, 10.1051/ro/1981150201851
M.MinouxandJ. J.Strodiot Un algorithme exact pur les problèmes de multiflots de cot minimum avec fonctions de cot concaves. Unpublished report—CNET (1982).
J. D.Murchland A fixed matrix for all shortest distances in a directed graph and for the inverse problem. Doctoral Thesis University of Karlsruhe (1970).
Schwartz M., 1977, Computer Communications Network Design and Analysis
Stairs S., 1968, Selecting an optimal traffic network, J. Transport Econ. Policy, 2, 218
Steenbrink P. A., 1974, Optimization of Transport Networks
Tuy H., 1964, Concave programming under linear constraints, Dokl. Akad. Nauk. SSR, 159, 32
1964, Translated Soviet Math., 5, 1437
H.Tuy Global maximization of a convex function over a closed convex not necessarily bounded set. Unpublished Report.1982.
L.Van SickleandK. M.Chandy Computational complexity of network algorithms.IFIP Congress Proceedings (1977)235–239.
Yaged B., 1973, Minimum cost routing for dynamic network models, 3, 193