This paper addresses the problem of selecting a set of paths to optimize the performance of a combinational circuit. Comparison between different path enumeration algorithms is presented here considering realistic delay values for the different path elements. Application is given on ISCAS'85 benchmarks where the CPU times of the different investigated algorithms are compared.