Ageev, A. A. An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays. (Russian) Zbl 1249.90065 Diskretn. Anal. Issled. Oper., Ser. 1 14, No. 4, 3-15 (2007). MSC: 90B35 PDF BibTeX XML Cite \textit{A. A. Ageev}, Diskretn. Anal. Issled. Oper., Ser. 1 14, No. 4, 3--15 (2007; Zbl 1249.90065)
Ageev, A. A. Metric location problems with nonshortest service routes. (Russian) Zbl 1249.90135 Diskretn. Anal. Issled. Oper., Ser. 1 14, No. 3, 3-12 (2007). MSC: 90B80 PDF BibTeX XML Cite \textit{A. A. Ageev}, Diskretn. Anal. Issled. Oper., Ser. 1 14, No. 3, 3--12 (2007; Zbl 1249.90135)
Ageev, A. A.; Baburin, A. E.; Gimadi, Eh. Kh. A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight. (Russian) Zbl 1249.05232 Diskretn. Anal. Issled. Oper., Ser. 1 13, No. 2, 11-20 (2006). MSC: 05C45 05C85 PDF BibTeX XML Cite \textit{A. A. Ageev} et al., Diskretn. Anal. Issled. Oper., Ser. 1 13, No. 2, 11--20 (2006; Zbl 1249.05232)
Ageev, A. A.; Il’ev, V. P.; Kononov, A. V.; Televnin, A. S. Computational complexity of the graph approximation problem. (Russian) Zbl 1249.68085 Diskretn. Anal. Issled. Oper., Ser. 1 13, No. 1, 3-15 (2006). MSC: 68Q25 05C85 68Q17 PDF BibTeX XML Cite \textit{A. A. Ageev} et al., Diskretn. Anal. Issled. Oper., Ser. 1 13, No. 1, 3--15 (2006; Zbl 1249.68085)
Ageev, A. A. The complexity of finding a maximal weighted join in a graph. (Russian) Zbl 0882.05117 Diskretn. Anal. Issled. Oper., Ser. 1 4, No. 3, 3-8 (1997). Reviewer: O.V.Borodin (Novosibirsk) MSC: 05C99 68Q25 68R10 PDF BibTeX XML Cite \textit{A. A. Ageev}, Diskretn. Anal. Issled. Oper., Ser. 1 4, No. 3, 3--8 (1997; Zbl 0882.05117)