The Feasibility Pump. Fischetti, M., Glover, F., & Lodi, A. Mathematical Programming, 104(1):91–104, September, 2005.
doi  abstract   bibtex   
In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min\cTx:Ax$≥$b,xjinteger $∀$j $∈$ \. Trivially, a feasible solution can be defined as a point x* $∈$ P:=\x:Ax$≥$b\ that is equal to its rounding , where the rounded point is defined by := x*jif j $∈$ and := x*jotherwise, and [$·$] represents scalar rounding to the nearest integer. Replacing ``equal'' with ``as close as possible'' relative to a suitable distance function $Δ$(x*, ), suggests the following Feasibility Pump (FP) heuristic for finding a feasible solution of a given MIP.
@article{fischetti05feasibility,
  title = {The Feasibility Pump},
  author = {Fischetti, Matteo and Glover, Fred and Lodi, Andrea},
  year = {2005},
  month = sep,
  journal = {Mathematical Programming},
  volume = {104},
  number = {1},
  pages = {91--104},
  issn = {1436-4646},
  doi = {10.1007/s10107-004-0570-3},
  abstract = {In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min\{cTx:Ax{$\geq$}b,xjinteger {$\forall$}j {$\in$} \}. Trivially, a feasible solution can be defined as a point x* {$\in$} P:=\{x:Ax{$\geq$}b\} that is equal to its rounding , where the rounded point is defined by := x*jif j {$\in$} and := x*jotherwise, and [{$\cdot$}] represents scalar rounding to the nearest integer. Replacing ``equal'' with ``as close as possible'' relative to a suitable distance function {$\Delta$}(x*, ), suggests the following Feasibility Pump (FP) heuristic for finding a feasible solution of a given MIP.},
  langid = {english},
  file = {/Users/acosta/Documents/zotero files/Fischetti et al. - 2005 - The feasibility pump.pdf}
}

Downloads: 0