Abstract
In current mixed-integer programming (MIP) solvers heuristics are used to find feasible solutions before the branch-and-bound or branchand-cut algorithm is applied to the problem. Knowing a feasible solution can improve the solutions found or the time to solve the problem very much. This paper discusses hybrid heuristics for this purpose. Hybrid in this context means that these heuristics use the branch-and-bound algorithm to search a smaller subproblem. Several possible hybrid heuristics are presented and computational results are given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balas, Egon; Martin, Clarence H.: Pivot and Complement — A Heuristic for 0–1 Programming. In: Management Science 26(1) (1980), S. 86–96
Løkketangen, Arne; Glover, Fred: Solving Zero-one Mixed Integer Programming Problems Using Tabu Search. In: European Journal of Operations Research 106(2–3) (1998), S. 624–658
Balas, Egon; Ceria, Sebastián; Dawande, Milind; Margot, Francois; Pataki, Gábor: OCTANE: A New Heuristic For Pure 0–1 Programs. In: Operations Research 49(2) (2001), S. 207–225
Fischetti, Matteo; Lodi, Andrea: Local Branching. In: Mathematical Programming 98(1–3) (2003), S. 23–47
Danna, Emilie; Rothberg, Edward; Le Pape, Claude: Exploring Relaxation Induced Neighborhoods to Improve MIP Solutions. In: Mathematical Programming101(1) (2004), S. 71–90
Christopel, Philipp M.: An Improved Heuristic for the MOPS Mixed-integer Programming Solver, University of Paderborn-DS&OR Lab, Diplomarbeit, 2005
Yagiura, M.; Ibaraki, T.: Local Search. In: Pardalos, P. M. (Hrsg.); Resende, M. G. C. (Hrsg.): Handbook of Applied Optimization. Oxford University Press, Oxford, 2002
Suhl, Uwe H.: MOPS-Mathematical OPtimization System. In: European Journal of Operations Research 72 (1994), S. 312–322
Suhl, Uwe H.; Waue, Veronika: Fortschritte bei der Lösung gemischtganzzahliger Optimierungsmodelle. In: Suhl, Leena (Hrsg.); Voss, Stefan (Hrsg.): Quantitative Methoden in ERP und SCM. 2004 (DSOR Beiträge zur Wirtschaftsinformatik, Band 2)
Suhl, Uwe H.: Solving Large-scale Mixed-Integer Programs with Fixed Charge Variables. In: Mathematical Programming 32 (1985), S. 165–182
Achterberg, Tobias; Martin, Alexander; Koch, Thorsten: The Mixed Integer Problem Library: MIPLIB 2003. Version: 2003. http://miplib.zib.de. — Online-Ressource, Abruf: 2005-07-28
Dolan, Elizabeth D.; Moré, Jorge J.: Benchmarking Optimization Software with Performance Profiles. In: Mathematical Programming 91 (2002), S. 201–213
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christophel, P.M., Suhl, L., Suhl, U.H. (2006). Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_56
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)