A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important N P-complete problem that can be extremely hard in practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible solution to general MIPs that can be viewed as a clever way to round a sequence of fractional solutions of the LP relaxation, until a feasible one is eventually found. In this paper we study the effect of replacing the original rounding function (which is fast and simple,doi:10.1007/s12532-009-0007-3 fatcat:ldh62x2yhjgatpd7nmywefv7qu