Aneja, Y. P. An integer linear programming approach to the Steiner problem in graphs. (English) Zbl 0445.90087 Networks 10, 167-178 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 38 Documents MSC: 90C35 Programming involving graphs or networks 90C10 Integer programming 05C05 Trees 65K05 Numerical mathematical programming methods Keywords:integer linear programming; Steiner problem in graphs; connected undirected graph; minimal weighted tree; set covering formulation; row generation scheme PDF BibTeX XML Cite \textit{Y. P. Aneja}, Networks 10, 167--178 (1980; Zbl 0445.90087) Full Text: DOI References: [1] Prim, Bell Syst. Tech. J. 36 pp 1389– (1957) [2] Kruskal, Proc. Am. Math. Soc. 7 pp 48– (1956) [3] Nastansky, Zeit. Oper. Res. 18 pp 59– (1974) [4] Dreyfus, Networks 1 pp 195– (1972) [5] Hakimi, Networks 1 pp 113– (1971) [6] Aneja, Manag. Sci. 23 pp 652– (1977) [7] Bellmore, Manag. Sci. 18 pp 194– (1971) [8] Lemke, Oper. Res. 19 pp 998– (1971) [9] and , Integer Programming, Wiley, New York, 1972. [10] Gomory, J. SIAM 9 pp 551– (1961) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.