A recursive binary splitting and recombination procedure coupled with a specially tailored genetic algorithm provides a solution to the general binary minimization problem with much lower run times than other methods. A minor modification to the procedure solves a variant of the binary minimization problem using an alternate operator logic that is crucial to solving certain combinatorial geometry problems.