Granot, Frieda; Skorin-Kapov, Jadranka Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm. (English) Zbl 0694.90075 Math. Program., Ser. A 46, No. 2, 225-236 (1990). Reviewer: J.Ramik MSC: 90C20 90C25 68Q25 PDFBibTeX XMLCite \textit{F. Granot} and \textit{J. Skorin-Kapov}, Math. Program. 46, No. 2 (A), 225--236 (1990; Zbl 0694.90075) Full Text: DOI
Robertson, Neil; Seymour, P. D. Graph minors. II. Algorithmic aspects of tree-width. (English) Zbl 0611.05017 J. Algorithms 7, 309-322 (1986). MSC: 05C05 05C10 05C38 68R10 PDFBibTeX XMLCite \textit{N. Robertson} and \textit{P. D. Seymour}, J. Algorithms 7, 309--322 (1986; Zbl 0611.05017) Full Text: DOI
Glover, Fred; Glover, Randy; Klingman, Darwin Threshold assignment algorithm. (English) Zbl 0605.90099 Math. Program. Study 26, 12-37 (1986). Reviewer: Ch.N.Potts MSC: 90C27 90C35 68Q25 90B10 90C05 PDFBibTeX XMLCite \textit{F. Glover} et al., Math. Program. Study 26, 12--37 (1986; Zbl 0605.90099) Full Text: DOI
Chandrasekaran, R. Recognition of Gilmore-Gomory traveling salesman problem. (English) Zbl 0599.90121 Discrete Appl. Math. 14, 231-238 (1986). Reviewer: K.G.Murty MSC: 90C35 65K05 68Q25 PDFBibTeX XMLCite \textit{R. Chandrasekaran}, Discrete Appl. Math. 14, 231--238 (1986; Zbl 0599.90121) Full Text: DOI
Glover, F.; Klingman, D.; Phillips, N. A new polynomially bounded shortest path algorithm. (English) Zbl 0578.90089 Oper. Res. 33, 65-73 (1985). MSC: 90C35 68Q25 05C35 PDFBibTeX XMLCite \textit{F. Glover} et al., Oper. Res. 33, 65--73 (1985; Zbl 0578.90089) Full Text: DOI
Martins, Ernesto Q. V.; Rosa, Mario S. An algorithm for the maximal multicommodity funnel-node flow in an undirected network. (English) Zbl 0572.90023 Oper. Res. 33, 537-547 (1985). Reviewer: V.Peteanu MSC: 90B10 68Q25 PDFBibTeX XMLCite \textit{E. Q. V. Martins} and \textit{M. S. Rosa}, Oper. Res. 33, 537--547 (1985; Zbl 0572.90023) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by cliques and by finite families of graphs. (English) Zbl 0582.05046 Discrete Math. 49, 45-59 (1984). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Discrete Math. 49, 45--59 (1984; Zbl 0582.05046) Full Text: DOI Backlinks: MO
Tinhofer, G. Rational solutions of the graphsack problem. (English) Zbl 0532.90069 Math. Program. 28, 337-348 (1984). MSC: 90C09 65K05 68Q25 90C35 90C05 90C10 PDFBibTeX XMLCite \textit{G. Tinhofer}, Math. Program. 28, 337--348 (1984; Zbl 0532.90069) Full Text: DOI
Liu, Zhenhong Approximate algorithms for combinatorial optimization. II. (Chinese) Zbl 0547.90075 Math. Pract. Theory 1983, No. 4, 65-75 (1983). Reviewer: H.T.Lau MSC: 90C10 05C35 65K05 05A05 68Q25 90B35 90C09 PDFBibTeX XMLCite \textit{Z. Liu}, Math. Pract. Theory 1983, No. 4, 65--75 (1983; Zbl 0547.90075)
Liu, Zhenhong Approximate algorithms for combinatorial optimization. I. (Chinese) Zbl 0547.90074 Math. Pract. Theory 1983, No. 3, 66-74 (1983). Reviewer: H.T.Lau MSC: 90C10 05C35 65K05 05A05 68Q25 90B35 90C09 PDFBibTeX XMLCite \textit{Z. Liu}, Math. Pract. Theory 1983, No. 3, 66--74 (1983; Zbl 0547.90074)
Trubin, V. A. Two classes of location problems on tree networks. (English. Russian original) Zbl 0538.90023 Cybernetics 19, 539-544 (1983); translation from Kibernetika 1983, No. 4, 84-87 (1983). MSC: 90B05 90C10 68Q25 PDFBibTeX XMLCite \textit{V. A. Trubin}, Cybernetics 19, 539--544 (1983; Zbl 0538.90023); translation from Kibernetika 1983, No. 4, 84--87 (1983) Full Text: DOI
Frank, Andras Finding feasible vectors of Edmonds-Giles polyhedra. (English) Zbl 0474.90079 Rep., Inst. Ökon. Oper. Res., Rheinische Friedrich-Wilhelms-Univ., Bonn. 81205-OR, 24 p. (1981). MSC: 90C35 68Q25 52Bxx PDFBibTeX XML
Elken, T. R.; Freedman, H. T.; Gibson, A. E. A polynomially bounded algorithm for a nonlinear network allocation problem. (English) Zbl 0467.90071 Manage. Sci. 27, 1054-1066 (1981). MSC: 90C35 90B10 65K05 68Q25 PDFBibTeX XMLCite \textit{T. R. Elken} et al., Manage. Sci. 27, 1054--1066 (1981; Zbl 0467.90071) Full Text: DOI
Lawler, Eugene L. Combinatorial optimization: Networks and matroids. (English) Zbl 0413.90040 New York etc.: Holt, Rinehart and Winston. X, 374 p. (1976). MSC: 90C35 90-01 05B35 05C35 68Q25 05-02 90C10 68R10 90B10 PDFBibTeX XML