Methods for constructing best nonlinear Chebyshev approximations are discussed. It is shown that local strong unicity is sufficient to guarantee "good numerical behaviour" of the algorithms. Applications are given for approximations by splines with free knots, rational functions, and exponential sums as well as for the approximation of functions defined by differential equations.