Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm? We generally call an algorithm "good algorithm" if it's runnning time is polynomial in the worst-case.
But in some cases (for example Simplex algorithm), eventhough the worst-case of the algorithm is exponential, it could work very well in practice. 

Are there any (deterministic) examples to this situatation other than Simplex algorithm?
The $k$-means algorithm for clustering is provably exponential even in the plane, but it works very well in practice.