The paper presents in a self-contained form three improved versions of Scarf's combinatorial method for finding fixed points. The first version allows to avoid the use of slack elements in primitive sets and hence to work only with conventional subsimplices. The second makes it possible to restart as in Merrill's algorithm, while the third is a continuation procedure similar to the homotopy method by Eaves.