Combinatorial optimisation algorithms are central to addressing problems in which the goal is to select an optimal solution from a finite set of alternatives. These algorithms have evolved ...

This paper describes a greedy heuristic for a class of combinatorial optimization problems; a central feature of the method being a look-ahead capability. The power of the heuristic is demonstrated ...