<Para ID="Par1">Recently, a walk-and-round heuristic was proposed by Huang and Mehrotra (Comput Optim Appl, <CitationRef CitationID="CR24">2012</CitationRef>) for generating high quality feasible solutions of mixed integer linear programs. This approach uses geometric random walks on a polyhedral set to sample points in this set. It subsequently rounds...</citationref></para>

Feasibility pump is a general purpose technique for finding feasible solutions of mixed integer programs. In this paper we report our computational experience on using geometric random walks and a random ray approach to provide good points for the feasibility pump. Computational results on <Emphasis...</emphasis>