in reply to Re^2: Evolving a faster filter? (sort) in thread Evolving a faster filter?
my @order = sort {
$Costs[$a]+$Trims[$a]*$Costs[$b] <=> $Costs[$b]+$Trims[$b]*$Costs[
+$a]
} 0..$#Costs;
I'm pretty sure that this is the optimal solution, but I'm too lazy to write down the complete mathematical proof.
The basic idea is that the terms represent the general cost difference of swapping the first and the second filter¹!
So by sorting you get a solution which can't be improved by a pairwise swapping and any permutation can be represented by a sequence of pairwise swaps.
¹) see restructured formula for c in Re^2: Evolving a faster filter? (combinatorics) and you will notice that these are the first elements and the rest is fix.
UPDATE:
basic transformations lead to a simpler solution:
my @order = sort {
$Costs[$a]/(1$Trims[$a]) <=> $Costs[$b]/(1$Trims[$b])
} 0..$#Costs;
which can be precalculated to save calculation time
my @order = sort {
$weight[$a] <=> $weight[$b]
} 0..$#Costs;
(the edge case of a division by zero must be handled as practically infinity)
Re^4: Evolving a faster filter? (optimal?) by tye (Sage) on Jan 04, 2013 at 21:32 UTC 
That's not enough to prove it. You certainly get a solution that can't be improved by a single swapping of adjacent filters. And if your sort order using that algorithm is welldefined, then you will get an optimal solution. That is, if you never get the $a < $b < $c < $a case. Update: No, maybe not even that (unless someone can convince me that "of adjacent filters" is not needed above). Update: Ah, ruling out adjacent swaps also rules out any swaps. Update: Silly me. Ruling out swapping of elements that start out adjacent doesn't rule out swapping of elements that didn't start out adjacent (but became adjacent from swapping elements that did start out adjacent).
I thought I had already found a case where it wasn't optimal. But the total cost was reported as identical as the first cost despite a different ordering being chosen. So it might be hard to find a case where it isn't optimal.
I bet it makes doing anything more than that not worth the effort for Ovid's usage, at least. :)
 [reply] [d/l] 

Well my argument is sufficient to show that a solution where two adjacent filters don't follow this order can't be optimal, because otherwise swapping those adjacent filters f[i] and f[i+1] would improve the result.
So any optimal solution must follow this strict order criteria. ¹
qed! =)
PS: I'm glad I didn't start implementing the B&B algorithm :)
UPDATE:
¹) and it's easy to see that all ordered solutions (plural b/c adjacent filters can have the same weight) imply the same total cost.
 [reply] [d/l] [select] 

Indeed!
And the number of choices that leaves you with is rather tiny.
Worse (or better), from throwing cases at the code, I bet it is possible to prove that all such orderings are optimal so that the one that sort gives you is optimal.
I think it might not be hard to prove and $a <= $b <= $c implies $a <= $c (assuming nonnegative cost and selectivity between 0 and 1). And that should be enough.
 [reply] 
