We introduce an algorithm that layers quantum speedups over a broad class of classical branch and bound style methods. Formal analysis informs practical heuristics and circuit constructions, and we estimate resources with current error correction considerations to assess paths toward practical advantage.