This paper describes algorithmic approaches for dealing with fuzziness in some highly structured combinatorial problems. A general framework is described and three real-life examples are presented.