Ryan, Christopher Thomas; Smith, Robert L. A greedy algorithm for finding maximum spanning trees in infinite graphs. (English) Zbl 1525.90420 Oper. Res. Lett. 50, No. 6, 655-659 (2022). MSC: 90C35 05C63 PDFBibTeX XMLCite \textit{C. T. Ryan} and \textit{R. L. Smith}, Oper. Res. Lett. 50, No. 6, 655--659 (2022; Zbl 1525.90420) Full Text: DOI
De Bontridder, K. M. J.; Halldórsson, B. V.; Halldórsson, M. M.; Hurkens, C. A. J.; Lenstra, J. K.; Ravi, R.; Stougie, L. Local improvement algorithms for a path packing problem: a performance analysis based on linear programming. (English) Zbl 1525.90414 Oper. Res. Lett. 49, No. 1, 62-68 (2021). MSC: 90C35 05C38 05C70 90C10 PDFBibTeX XMLCite \textit{K. M. J. De Bontridder} et al., Oper. Res. Lett. 49, No. 1, 62--68 (2021; Zbl 1525.90414) Full Text: DOI
Monnot, Jérôme; Toulouse, Sophie The path partition problem and related problems in bipartite graphs. (English) Zbl 1129.05034 Oper. Res. Lett. 35, No. 5, 677-684 (2007). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Monnot} and \textit{S. Toulouse}, Oper. Res. Lett. 35, No. 5, 677--684 (2007; Zbl 1129.05034) Full Text: DOI
Hassin, Refael; Rubinstein, Shlomi On the complexity of the \(k\)-customer vehicle routing problem. (English) Zbl 1076.90061 Oper. Res. Lett. 33, No. 1, 71-76 (2005). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{R. Hassin} and \textit{S. Rubinstein}, Oper. Res. Lett. 33, No. 1, 71--76 (2005; Zbl 1076.90061) Full Text: DOI
Woeginger, Gerhard J. An efficient algorithm for a class of constraint satisfaction problems. (English) Zbl 1030.90112 Oper. Res. Lett. 30, No. 1, 9-16 (2002). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Oper. Res. Lett. 30, No. 1, 9--16 (2002; Zbl 1030.90112) Full Text: DOI
Bollobás, Béla; Meir, A. A travelling salesman problem in the \(k\)-dimensional unit cube. (English) Zbl 0773.90080 Oper. Res. Lett. 11, No. 1, 19-21 (1992). MSC: 90C35 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Meir}, Oper. Res. Lett. 11, No. 1, 19--21 (1992; Zbl 0773.90080) Full Text: DOI