Abstract
We introduce a new pure integer rounding heuristic, ZI Round, and compare this heuristic to recent extremely fast pure integer rounding heuristic Simple Rounding. Simple Rounding was introduced in the non-commercial code SCIP. ZI Round attempts to round each fractional variable while using row slacks to maintain primal feasibility. We use the MIPLIB 2003 library for the test set. The average time in our run per instance for both Simple Rounding and ZI Round was 0.8 milliseconds, but ZI Round found more feasible solutions with a the same or better objective value. Also the average time to solve the lp relaxation per instance was 2.2 seconds, so these two rounding heuristics are several magnitudes faster than other heuristics which must use the lp solver, including diving heuristics. We also show that ZI Round performs well on a set covering class and a railway crew scheduling class.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Achterberg, T.: Constraint integer programming. Ph.D. thesis. University of Berlin (July 2007). http://opus.kobv.de/tuberlin/volltexte/2007/1611/. Accessed 12 October 2008
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 1–12 (2006). http://miplib.zib.de/. Accessed 12 October 2008
Berthold, T.: Primal heuristics for mixed integer programs. Masters Thesis. University of Berlin (September 2006). http://www.zib.de/groetschel/students/Diplom-Berthold.pdf. Accessed 12 October 2008
Berthold, T.: Heuristics of the branch-cut-and-price-framework SCIP. In: Operations Research Proceedings, March 20, pp. 31–36 (2008)
Bixby, R., Ceria, S., McZeal, M., Savelsbergh, M.: MIPLIB 3.0. http://www.caam.rice.edu/~bixby/miplib/miplib.html. Accessed 15 November 2008
Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23–47 (2003)
Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104, 91–104 (2005)
Fulkerson, D., Nemhauser, G., Trotter, L. Jr.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Program. Study 2, 72–81 (1974)
Mittelmann, H.: Mixed integer linear programming benchmark (2008a). http://plato.asu.edu/ftp/milpf.html. Accessed 12 October 2008
Mittelmann, H.: Recent updates to our benchmarks. In: SIAM Conference on Optimization, Boston, MA, May 10–13 (2008b). http://plato.asu.edu/talks/op08scip.pdf. Accessed 12 October, 2008
SCIP: http://scip.zib.de/. Accessed 12 October 2008
Author information
Authors and Affiliations
Corresponding author
Electronic Supplementary Material
Rights and permissions
About this article
Cite this article
Wallace, C. ZI round, a MIP rounding heuristic. J Heuristics 16, 715–722 (2010). https://doi.org/10.1007/s10732-009-9114-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-009-9114-6