Create a generic routine that maximizes a given objective function over permutations. This almost certainly already exists.
Optimizations: quickly calculate an updated function given the delta (operation) from the previous state, e.g., a swap. Store wisdom between successive calls to the objective function. Forbid inserts and shifts if they are a priori known to be bad operations.
Perhaps also all possible trees.
No comments :
Post a Comment