K. Altinkemer, Parallel savings heuristic for designing multicenter tree networks,Proc. HICSS-22 (1989), pp.762–769.
K. Altinkemer and B. Gavish, Parallel savings heuristic for the delivery problem, Oper. Res., in print.
K. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Oper. Res. Lett. 6(1987)149–158.
K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks, Manag. Sci. 34(1988)331–341.
K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Transp. Sci., in print.
J.E. Beasley, Route first-component second methods for vehicle routing, Omega 11(1983)403–408.
R.R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Trans. Comm. COM-25(1977)29–47.
P.M. Camerini, G. Galbiati and F. Maffioli, Complexity of spanning tree problems: Part 1, Eur. J. Oper. Res. 5(1980)346–352.
P.M. Camerini, G. Galbiati and F. Maffioli, On the complexity of finding multi-constrained spanning trees, Discr. Appl. Math. 5(1983)39–50.
K.M. Chandy and T. Lo, The capacitated minimum tree, Networks 3(1973)173–182.
K.M. Chandy and K.M. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comm. COM-21(1972)1062–1066.
N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report No. 388, Graduate School of Industrial Administration, Carnegie-Mellon University (Feb. 1976).
N. Christofides, A. Mingozzi and P. Toth, The vehicle routing problem, in:Combinatorial Optimization (Wiley, New York, 1979).
N. Christofides, A. Mingozzi and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math. Progr. 20(1981)255–282.
S. Eilon and N. Christofides, The loading problem, Manag. Sci. 17(1971)259–268.
D. Elias and M.J. Ferguson, Topological design of multipoint teleprocessing networks, IEEE Trans. Comm. COM-22(1974)1753–1762.
L.R. Esau and K.C. Williams, On teleprocessing system design, Part 2, IBM Syst. J. 5(1966)142–147.
B. Gavish, Topological design of centralized computer networks — formulations and algorithms, Networks 12(1982)355–377.
B. Gavish, Formulations and algorithms for the capacitated minimal directed tree, J. ACM 30(1983)118–132.
B. Gavish, The delivery problem — new cutting plane procedures,TIMS 26th Int. Meeting, Copenhagen (1984).
B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Comm. COM-33(1985)1247–1257.
B. Gavish, Topological design of computer communication networks — the overall design problem, Eur. J. Oper. Res., to be published.
B. Gavish, Topological design and capacity assignment in computer communication networks, Working Paper, Owen Graduate School of Management (1990).
B. Gavish and K. Altinkemer, A parallel savings heuristic for the topological design of local access tree networks,Proc. IEEE-INFOCOM'86 (1986), pp. 130–139.
B. Gavish, C.L. Li and D. Simchi-Levi, Analysis of heuristics for the design of tree networks, Ann. of Oper. Res., to be published.
M.C. Goldstein, Design of long-distance telecommunication networks — the Telepak problem, IEEE Trans. Circuit Theory CT-20(1973)186–192.
M. Haimovich and A. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math. Oper. Res. 10(1985)527–542.
E. Hansler, A heuristic configuration procedure for cost minimal communication networks, IBM Research Report RZ-666 (1974).
D.B. Johnson, Shortest paths in dense networks, J. ACM 24(1977)1–13.
M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Comm. COM-24(1976)500–505.
A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Comm. COM-22(1974)1762–1772.
A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second order greedy algorithms for centralized teleprocessing network design, IEEE Trans. Comm. COM-28(1980)1835–1838.
A. Kershenbaum and R. Boorstyn, Centralized teleprocessing network design, Networks 13(1983)279–293.
J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7(1956)48–50.
C.L. Li and D. Simchi-Levi, Analysis of heuristcs for the multi-depot capacitated vehicle routing problems, Working Paper, Department of Industrial Engineering and Operations Research, Columbia University, New York (1989).
P.M. McGregor and D. Shen, Network design: An algorithm for access facility location problems, IEEE Trans. Comm. COM-25(1977)61–73.
A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15(1985)1–20.
R.H. Mole, D.G. Johnson and K. Wells, Combinatorial analysis for route first-component second vehicle routing, Omega 11(1983)507–512.
C.H. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217–230.
H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Comp. Oper. Res. 14(1987)197–208.
H. Pirkul, S. Narasimhan and R. De, Locating concentrators for primary and secondary coverage in a computer communication network, IEEE Trans. Comm. COM-36(1988)450–458.
R.C. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389–1401.
D. Rosenkrantz, R. Sterns and P. Lewis, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comp. 6(1977)563–581.
B. Rothfarb and M.C. Goldstein, The one-terminal Telepak problem, Oper. Res. 19(1971) 156–169.
G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Comp. Networks 6(1982)1–11.
R.L. Sharma, Design of an economical multidrop network topology with capacity constraints, IEEE Trans. Comm. COM-31(1983)590–591.