Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics

Philipp M. Christophel (), Leena Suhl () and Uwe H. Suhl ()
Additional contact information
Philipp M. Christophel: University of Paderborn
Leena Suhl: University of Paderborn
Uwe H. Suhl: Freie Universität Berlin

A chapter in Operations Research Proceedings 2005, 2006, pp 355-360 from Springer

Abstract: 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.

Keywords: Search Space; Feasible Solution; Linear Programming Relaxation; Relaxation Solution; Hybrid Heuristic (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_56

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_56

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().