Optimal trees

Handbooks in Operations Research and Management Science

Volumn 7, Issue C, 1995, Pages 503-615

  Magnanti, Thomas L ^a   Wolsey, Laurence A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957043865     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80126-4     Document Type: Review

References (97)

1. Aggarwal, A., Park, J., Improved algorithms for economic lot-size problems. Oper. Res. 41 (1993), 549–571.
2. (to appear)Aghezzaf, E.H., Magnanti, T.L., Wolsey, L.A., Optimizing constrained subtrees of trees. Math. Program., 69, 1995.
3. Ahuja, R., Magnanti, T., Orlin, J., Network Flows: Theory, Algorithms, and Applications. 1993, Prentice-Hall.
4. Unpublished Manuscript Araque, J.R., Solution of a 48-city routing problem by branch-and-cut. 1989, Department of Applied Mathematics and Statistics, SUNY at Stony Brook, Englewood Cliffs, NJ.
5. Core DP 9061 Araque, J.R., Hall, L.A., Magnanti, T.L., Capacitated trees, capacitated routing and associated polyhedra. 1990, Louvain-la-Neuve, Stony Brook, N.Y.
6. Arnborg, S., Lagergren, J., Seese, D., Easy problems for tree decomposable graphs. J. Algorithms 12 (1991), 308–340.
7. Balakrishnan, A., Magnanti, T., Mirchandani, P., Modeling and heuristic worst-case performance analysis of the two-level network design problem. Manage. Sci. 40 (1994), 846–867.
8. Balakrishnan, A., Magnanti, T., Mirchandani, P., A dual-based algorithm for multi-level network design. Manage. Sci. 40 (1994), 567–581.
9. to appear Balakrishnan, A., Magnanti, T., Mirchandani, P., Heuristics, LPs, and network design analyses of trees on trees. Opers. Res., 43, 1995.
10. in press Balakrishnan, A., Magnanti, T.L., Wong, R.T., A decomposition algorithm for expanding local access telecommunications networks. Oper. Res., 43, 1995.
11. Bárány, I., Edmonds, J., Wolsey, L.A., Packing and covering a tree by subtrees. Combinatorica 6 (1986), 245–257.
12. Study Bárány, I., Van Roy, T.J., Wolsey, L.A., Uncapacitated lot-sizing: The convex hull of solutions. Math. Program. 22 (1984), 32–43.
13. Beasley, J.E., An SST-based algorithm for the Steiner problem on graphs. Networks 19 (1989), 1–16.
14. Berman, P., Ramaiyer, V., Improved approximation of the Steiner tree problem. Proc. 3rd Annu. ACM-SIAM Symp. on Discrete Algorithms, 1992, 325–334.
15. Berge, C., Ghouila-Houri, A., Programming, Games, and Transportation Networks. 1962, John Wiley, Belgium.
16. Bertsekas, D., Gallager, R., Data Networks. 2nd edition, 1992, Prentice-Hall, New York.
17. Bienstock, D., Goemans, M., Simchi-Levi, D., Willianson, D., A note on the prize-collecting travelling salesman problem. Math. Program. 59 (1993), 413–420.
18. Bodin, L., B. Golden, A. Assad and M. Ball, Routing and Scheduling of Vehicles and Crews: The State of the Art. Comput. Oper. Res. 10, 69–211.
19. Boruvka, O., Příspekěv křešení otzky ekonomické stavby elektrovodních sítí. Elektrotech. Obzor 15 (1926), 153–154.
20. Camerini, P.M., Galbiati, G., Maffioli, F., The complexity of weighted multi-constrained spanning tree problems. Colloq. Math. Soc. János Boltai, Theory of Algorithms Pécs, 44, 1984.
21. Cattryse, D., Maes, J., Van Wassenhove, L.N., Set partitioning and column generation heuristics for capacitated dynamic lot-sizing. Eur. J. Oper. Res. 46 (1990), 38–47.
22. Chopra, S., Gorres, E., On the node weighted Steiner tree problem. 1990, Department of Managerial Economics and Decision Sciences, J. Kellogg School of Management, Northwestern University, Englewood Cliffs, NJ.
23. Chopra, S., Rao, M.R., The Steiner tree problem I: Formulations, compositions and extensions of facets. Math. Program., 64, 1994, New York University, 209–230.
24. Chopra, S., Rao, M.R., The Steiner tree problem II: Properties and classes of facets. Math. Program., 64, 1994, New York University, 231–246.
25. Chopra, S., Rao, M.R., The Partition Problem. Math. Program. 59 (1993), 87–116.
26. Chopra, S., Gorres, E.R., Rao, M.R., Solving the Steiner Tree problem on a graph using branch and cut. ORSA J. Comput. 4 (1992), 320–335.
27. Cook, S.A., The complexity of theorem-proving procedures. Proc. 3rd Annu. ACM Symp. on Theory of Computing, 1971, 151–158.
28. Cornuéjols, G., Harche, F., Polyhedral study of the capacitated vehicle routing problem. Math. Program. 60 (1993), 21–52.
29. Current, J.R., Revelle, C.S., Cohon, J.L., The hierarchical network design problem. Eur. J. Oper. Res. 27 (1986), 57–66.
30. Chapter 2 Desrosiers, J., Dumas, Y, Solomon, M., Soumis, F., Time Constrained Routing and Scheduling. Ball, M., Magnanti, T., Monma, C., Nemhauser, G., (eds.) Network Routing, Handbooks in Operations Research and Management Science, Vol. 8, 1995, North-Holland.
31. de Souza, C., Ferreira, C., Martin, A., Weismantel, R., Wolsey, L.A., Formulations and valid inequalities for node capacitated graph partitioning problem. Core Discussion, Paper DP9437, 1993, Université Catholique de Louvain, Amsterdam.
32. Duin, C., Volgenant, A., Reducing the hierarchical network design problem. Eur. J. Oper. Res. 39 (1989), 332–344.
33. Edmonds, J., Optimum branchings. J. Res. Nat. Bur. Stand. 71B (1967), 233–240.
34. Edmonds, J., Submodular functions, matroids and certain polyhedra. Guy, R., et al. (eds.) Combinatorial Structures and their Applications, 1970, Gordon and Breach, Louvain, 69–87.
35. Edmonds, J., Matroids and the greedy algorithm. Math. Program. 1 (1971), 127–136.
36. Eppen, G.D., Martin, R.K., Solving multi-item lot-sizing problems using variable definition. Oper. Res. 35 (1987), 832–848.
37. Federgrun, A., Tsur, M., A simple forward algorithm to solve general dynamic lot-size models with n periods in o(n log n) or O(n) time. Manage. Sci. 37 (1991), 909–925.
38. Francis, R.L., McGinnis, L.F., White, J.A., Facility Layout and Location: An Analytic Approach. 1992, Prentice-Hall, New York.
39. Gavish, B., Formulations and algorithms for the capacitated minimal directed tree problem. J. ACM 30 (1983), 118–132.
40. Gavish, B., Augmented Lagrangean based algorithms for centralized network design. IEEE Trans. Commun. 33 (1984), 1247–1275.
41. Goemans, M.X., Arborescence polytopes for series-parallel graphs. Discrete Appl. Math., 1994.
42. Goemans, M.X., The Steiner polytope and related polyhedra. Math. Program. 63 (1994), 157–182.
43. Goemans, M.X. (1992). Personal communication.
44. Goemans, M.X., Bertsimas, D., Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60 (1993), 145–166.
45. to appear Goemans, M., Willianson, D., A general approximation technique for constrained forest problems. Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992.
46. Goemans, M.X., Myung, Y-S., A catalog of Steiner tree formulations. Networks 23 (1993), 19–28.
47. Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs. 1980, Academic Press, Englewood Cliffs, NJ.
48. Graves, S., Rinnooy Kan, A.H.G., Zipkin, P., (eds.) Logistics of Production and Inventory, Handbooks of Operations Research and Management Science, Vol. 4, 1993, North-Holland, New York.
49. Groeflin, H., Liebling, T.M., Connected and alternating vectors: Polyhedra and algorithms. Math. Program. 20 (1981), 233–244.
50. Preprint SC 92-8 Groetschel, M., Martin, A., Weismantel, R., Packing Steiner trees: Polyhedral investigations. 1992, Konrad-Zuse Zentrum, Amsterdam.
51. Preprint SC 92-9 Groetschel, M., Martin, A., Weismantel, R., Packing Steiner trees: a cutting plane algorithm and computational results. 1992, Konrad-Zuse Zentrum, Berlin.
52. Chapter 10 Groetschel, M., Monma, C., Stoer, M., Design of survivable networks. Ball, M., Magnanti, T., Monma, C., Nemhauser, G., (eds.) Network Models, Handbooks in Operations Research and Management Science, Vol. 7, 1995, North-Holland, Berlin.
53. Groetschel, M., Wakayabashi, Y., A cutting plane algorithm for a clustering problem. Math. Program. 45 (1989), 59–96.
54. Hansen, P., Jaumard, B., de Aragao, M.P., Mixed integer column generation algorithms and the probabilistic maximum satisfiability problem. Balas, E., Cornuéjols, G., Kannan, R., (eds.) Proc. 2nd IPCO Conf., 1992, Carnegie Mellon University, Amsterdam, 165–180.
55. Hartigan, J.A., Clustering Algorithms. 1975, John Wiley.
56. Held, M., Karp, R.M., The travelling salesman problem and minimum spanning trees: Part II. Math. Program. 1 (1971), 6–25.
57. Hu, T.C., Kuh, E.S., (eds.) VLSI Layout: Theory and Design, 1985, IEEE Press, New York.
58. Hwang, F.W., Richards, D.S., Steiner tree problems. Networks 22 (1992), 55–90.
59. Hwang, F.W., Richards, D.S., Winter, P., The Steiner tree problem. Annals of Discrete Mathematics 53, 1992, North-Holland, New York, NY.
60. Iwainsky, A., Optimal Trees-A Short Overview on Problem Formulations, in Optimization of Connection Structures in Graphs. 1985, Central Institute of Cybernetics and Information Processes, Amsterdam.
61. Jarníck, V., Ojistém problému minimálním. Acta Soc. Nat. Moravicae 6 (1930), 57–63.
62. Johnson, E.L., Mehrotra, A., Nemhauser, G.L., Min-cut clustering. Math. Program. 62 (1993), 133–151.
63. Karp, R.M., Reducibility among Combinatorial Problems. Miller, R.E., Thatcher, J.W., (eds.) Complexity of Computer Computations, 1972, Plenum Press, Berlin, 85–103.
64. Klein, P., Ravi, R., A nearly best possible approximation for node weighted Steiner trees. Rinaldi, G., Wolsey, L.A., (eds.) Proc. 3rd IPCO Conf., 1993, 323–331.
65. Korte, B., Promel, H.J., Steger, A., Steiner Trees in VLSI Layout. Korte, B., Lovász, L., Promel, H.J., Schijver, A., (eds.) Paths, Flows and VLSI Layout, 1990, Springer, New York, 185–214.
66. Kruskal, J.B., On the shortest spanning tree of a graph and the travelling salesman problem. Proc. Am. Math. Soc., 7, 1956, 48–50.
67. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, 1985, John Wiley, Berlin.
68. Lawler, E.L., Combinatorial Optimization: Networks and Matroids. 1976, Holt, Rinehart and Winston, New York.
69. Leighton, T.E., Complexity Issues in VSLI. 1983, M.I.T. Press, New York.
70. Lengauer, T., Combinatorial Algorithms for Integrated Circuit Layout. 1990, John Wiley, Cambridge, MA.
71. Leung, J., Magnanti, T., Vachani, R., Facets and algorithms for capacitated lot sizing. Math. Program. 45 (1989), 331–360.
72. Lovász, L., Graph theory and integer programming. Ann. Discrete Math. 4 (1979), 141–158.
73. Lucena, A., Beasley, J.E., A branch and cut algorithm for the Steiner problem in graphs. Report, 1992, The Management School, Imperial College, New York.
74. Maculan, N., The Steiner problem in graphs. Ann. Discrete Math. 31 (1987), 185–212.
75. Magnanti, T., Vachani, R., A strong cutting plane algorithm for production scheduling with changeover costs. Oper. Res. 38 (1990), 456–473.
76. Margot, F., Prodon, A., Liebling, Th.M., Tree polytope on 2-trees. Math. Program. 63 (1994), 183–192.
77. Martin, R.K., Generating alternative mixed-integer programming models using variable redefinition. Oper. Res. 35 (1987), 331–359.
78. Martin, R.K., Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10 (1991), 119–128.
79. Mirchandani, P.B., Francis, R.L., Discrete Location Theory. 1990, John Wiley, London.
80. Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimization. 1988, John Wiley, New York.
81. Pochet, Y., A common derivation of TSP and VRP inequalities. Talk presented at the 3rd Cycle FNRS day on Combinatorial Optimization, Core, Louvain-la-Neuve, December 11th, 1992.
82. Pochet, Y., Wolsey, L.A., Solving multi-item lot-sizing problems with strong cutting planes. Manage. Sci. 37 (1991), 53–67.
83. Prim, R.C., Shortest connection networks and some generalizations. Bell System Tech. J. 36 (1957), 1389–1401.
84. RO 850315 Prodon, A., Liebling, T.M., Groeflin, H., Steiner's problem in two trees. 1985, Department of Mathematics, Ecole Polytechnique Fédérale de Lausanne, New York.
85. Schwartz, M., Computer and Communication Network Design and Analysis. 1977, Prentice-Hall.
86. Takamizawa, K., Nishizeki, T., Saato, N., Linear time computability of combinatorial problems on series-parallel graphs. J. ACM 29 (1982), 623–641.
87. Tanenbaum, A.S., Computer Networks. 2nd edition, 1989, Prentice-Hall, Englewood Cliffs, NJ.
88. Thizy, J.M., Van Wassenhove, L.N., A subgradient algorithm for the multi-item capacitated lot-sizing problem. IEE Trans. 18 (1986), 114–123.
89. Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., Solving binary cutting stock problems by column generation and branch-and-bound. 1992, Computational Optimization Center COC-92-09, Georgia Institute of Technology, Englewood Cliffs, NJ.
90. Van Hoesel, C.P.M., Wagelmans, A.P.M., Wolsey, L.A., Polyhedral characterization of the economic lot-sizing problem with start-up costs. SIAM J. Discrete Math. 7 (1991), 141–151.
91. Volgenant, A., A Lagrangian approach to the degree-constrained minimum spanning tree problem. Eur. J. Oper. Res. 39 (1989), 325–331.
92. Wagner, H.M., Whitin, T.M., A dynamic version of the economic lot size model. Manage. Sci. 5 (1958), 89–96.
93. Wagelmans, A.P.M., van Hoesel, C.P.M., Kolen, A.W.J., Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-whitin case. Oper. Res. 40:Supplement 1 (1992), 145–156.
94. Winter, P., Steiner problem in networks: a survey. Networks 17 (1987), 129–167.
95. Wong, R.T., Integer programming formulations of the travelling salesman problem. Proc. IEEE Conf. on Circuits and Computers, 1980, 149–152.
96. Wong, R.T., A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28 (1984), 271–287.
97. Zelikovsky, A.Z., An 11/6 approximation algorithm for the network Steiner problem. Algorithmica 9 (1993), 463–470.