This search permutations cpan iterator produces plenty of candidates.
The first hit Algorithm::Combinatorics has combinations() which sounds like your requirement.
See also cpan combinations next using words from your post.
In reply to Re: CPAN module to return successive combinations of n things taken k at a time
by LanX
in thread CPAN module to return successive combinations of n things taken k at a time
by ibm1620
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |