Trust me, doing EOLR and L4EP is probably the best way for a human to solve LSE. This and a few other LSE subsets may be useful under very certain circumstances, but even then it would be limited to a few useful algs, as most of them are just doing LR into L4EP anyway. Long been trying to come up with a super efficient alg based way to do LSE and all of them have fallen short for speed. EOLR is pretty easy to learn anyway.
EOLR+L4EP is a good method and proven, but I won't say that it is faster than the LMCF method of doing L6E which is basically the following:
1. Place one of UL or UR (or both) into the UL or UR slots in any orientation or permutation (this step is skipped 60% of the time)
2. Solve remaining UL/UR while orienting all edges
3. Permute M slice
Step 2 is the only step which uses algorithms and there are quite a few (32 direct set, 32 i-set, 32 d-set, 32 x-set, 32 r-set, 4 dd-set, 4 oo-set, 4 pure m-slice, 4 do-set, 4 dds-set, 4 dos-set = 184 cases of which around 2/3 are reflections).
EOLR claims to use around 60 algorithms but you also need reflections making it around 120, so similar.
The probability that UL doesn't contain either UL or UR is 4/6. In that same situation the probability that UR does not contain either UL or UR is 3/5. 4/6 * 3/5 = 12/30. So the probability that neither UL nor UR contains either of their respective edges is 12/30. That means the probability that they DO contain such an edge is 18/30. So for LMCF L6E, step 1 is skipped 18/30 solves, 60% of the time. In those 60% of cases I think the LMCF method is faster than EOLR. In the 40% of cases that neither UL nor UR contains either of their respective edges (in any permutation or orientation), then EOLR might be a bit faster. However, the LMCF method has another advantage in that it can be used for all sorts of hybrid methods where the L and R slices are not aligned, or out of phase by 90 degrees. Roux EOLR or any Roux LSE fails if the L and R slices are not aligned because the edge orientation cannot be easily determined.