Many applications of finite impulse response (FIR) digital filters impose strict format constraints for the filter coefficients. Such requirements increase the complexity of determining optimal designs for the problem at hand, making exact approaches intractable even for moderately high filter degrees. We introduce a fast and efficient heuristic, which is based on the computation of good nodes for polynomial interpolation and Euclidean lattice basis reduction. Most of the time, it returns quantized FIR filters of extremely good quality.