Mixed integer nonlinear programs (MINLPs) are a class of NP-hard optimization problems with a wide range of applications in science and industry. We motivate and present a new heuristic for finding feasible points rapidly, and show that its inclusion in a standard MINLP solver reduces the solution time significantly.