  J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 0:000-000, 0000.MathSciNetCrossRefMATH  T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 0:00-00, 0000.MathSciNetCrossRef00000-0)MATH  T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 00: 000-000, 0000.CrossRefMATH  G. Gutin and A.P. Punnen, editors. The traveling salesman problem and its variations. Kluwer Academic Publishers, Boston, 0000.MATH  J.P. Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 0:000-000, 0000.MathSciNetCrossRef00000-0)MATH  V. Jarník. O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti