FEASPUMP
Feasibility pump 2.0. Finding a feasible solution of a given mixed-integer programming (MIP) model is a very important đť’©đť’«-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, but somehow blind) with more clever rounding heuristics. In particular, we investigate the use of a diving-like procedure based on rounding and constraint propagation-a basic tool in Constraint Programming. Extensive computational results on binary and general integer MIPs from the literature show that the new approach produces a substantial improvement of the FP success rate, without slowing-down the method and with a significantly better quality of the feasible solutions found.
Keywords for this software
References in zbMATH (referenced in 66 articles )
Showing results 1 to 20 of 66.
Sorted by year (- Fischetti, Matteo; Lodi, Andrea; Monaci, Michele; Salvagnin, Domenico; Tramontani, Andrea: Improving branch-and-cut performance by random sampling (2016)
- Sharma, Shaurya; Knudsen, Brage Rugstad; Grimstad, Bjarne: Towards an objective feasibility pump for convex minlps (2016)
- Baena, Daniel; Castro, Jordi; GonzĂˇlez, JosĂ© A.: Fix-and-relax approaches for controlled tabular adjustment (2015)
- Huang, Kuo-Ling; Mehrotra, Sanjay: An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (2015)
- Humpola, Jesco; FĂĽgenschuh, Armin; Lehmann, Thomas: A primal heuristic for optimizing the topology of gas networks based on dual information (2015)
- Kirst, Peter; Stein, Oliver; Steuermann, Paul: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (2015)
- Obuchowska, WiesĹ‚awa T.: Irreducible infeasible sets in convex mixed-integer programs (2015)
- Agra, Agostinho; Christiansen, Marielle; Delgado, Alexandrino; Simonetti, Luidi: Hybrid heuristics for a short sea inventory routing problem (2014)
- Berthold, Timo: RENS. The optimal rounding (2014)
- Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
- Boland, Natashia; Eberhard, Andrew; Engineer, Faramroze; Fischetti, Matteo; Savelsbergh, Martin; Tsoukalas, Angelos: Boosting the feasibility pump (2014)
- Camargo, Victor C.B.; Toledo, Franklina M.B.; Almada-Lobo, Bernardo: HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (2014)
- De Santis, M.; Lucidi, S.; Rinaldi, F.: Feasibility Pump-like heuristics for mixed integer problems (2014)
- Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
- Naoum-Sawaya, Joe: Recursive central rounding for mixed integer programs (2014)
- Berthold, Timo; Salvagnin, Domenico: Cloud branching (2013)
- Bosco, Adamo; LaganĂ , Demetrio; Musmanno, Roberto; Vocaturo, Francesca: Modeling and solving the mixed capacitated general routing problem (2013)
- Dâ€™ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: an updated practical overview (2013)
- Guzelsoy, Menal; Nemhauser, George; Savelsbergh, Martin: Restrict-and-relax search for 0-1 mixed-integer programs (2013)
- Huang, Kuo-Ling; Mehrotra, Sanjay: An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (2013)