참고문헌
- Management Sci. v.34 Heuristics with constant error guarantees for the design of tree networks Altinkemer,K.;B.Gavish
- IEEE Trans. Comm. v.25 Lange scale network topological optimization Boorstyn,R.R.;H.Frank
- Networks v.3 The capacitated minimum spanning tree Chandy,K.M.;T.Lo
- IEEE Trans. Computers v.21 The design of multipoint linkage in a teleprocessing tree network Chandy,K.M.;R.A.Russell
- J. of Res. of the National Bureau of Standards-B. Mathmatics and Math. Physics v.71B Optimum branchings Edmonds,J.
- IEEE Trans. Comm. v.22 Topological design of multipoint teleprocessing networks Elias,D.;M.J.Ferguson
- Operations Res. v.26 A dual-based procedure for uncapacitated facility location Erlenkotter,D.
- IBM Systems J. v.5 On teleprocessing system design Part 2 Essau,L.R.;K.C.Williams
- Proc. IEEE v.60 Topological optimization of computer networks Frank,H.;W.Chou
- Networks v.1 Optimal design of centralized computer networks Frank,H.;I.T.Frisch;R. Van slyke;W.S.Chon
- Networks v.12 Topological design of centralized computer networks-formulations and algorithms Gavish,B.
- J. Assoc. Comput. mach. v.30 Formulations and algorithms for the capacitated minimal directed tree Gavish,B.
- IEEE Trans. Comm. v.33 Augmented Lagrangean based algorithms for centralized network design Gavish,B.
- Proc. IEEE-INFOCOM'86 A parallel savings heuristic for the topological design of local tree networks Gavish,B.;K.Altinkemer
- Math. Programming Study v.2 Lagrangean relaxation and its uses in integer programming Geoffrion,A.M.
- IEEE Trans. Comm. v.24 A new class of algorithms for multipoint network optimization Karnaugh,M.
- Networks v.4 Computing capacitated minmum spanning trees efficiently Kershenbaum,A.
- Networks v.13 Centralized teleprocessing network deoign Kershenbaum,A.;R.Boorstyn
- IEEE Trans. Comm. v.28 Second order greedy algorithms for centralized teleprocessing network design Kershenbaum,A.;R.Boorstyn;R.Oppenheim
- IEEE Trans. Comm. v.22 A unified algorithm for designing multidrop teleprocessing networks Kershenbaum,A.;W.Chou
- Computer Sci. Res. Report RC 9223, IBM T.J. Watson Res. center Communication network design and control algorithms-a survey Kobayashi,H.
- Europ. J. of Operational Res. v.12 The simple plant location problem Krarup,J.;P.M.Pruzan
- IEEE Trans. Comm. v.25 Network design : an algorithm for access facility location problem McGregor,P.M.;D.Shen
- Networks v.8 The complexity of the capacitated tree problem Papadimitriou,C.H.
- IEEE Trans. Comm. v.31 Design of an economical multidrop network topology with capacity constraints Sharam,R.L.
- Management Sci. v.28 A dual-based procedure for dynamic facility location Van Roy,T.J.;D.Erlenkotter
- Math. Programming v.28 A dual ascent approach for Steiner tree problems on a directed graph Wong,R.T.