Recent Advancements in Commercial Integer Optimization Solvers for Business Intelligence Applications
Cheng Seong Khor
A chapter in E-Business - Higher Education and Intelligence Applications from IntechOpen
Abstract:
The chapter focuses on the recent advancements in commercial integer optimization solvers as exemplified by the CPLEX software package particularly but not limited to mixed-integer linear programming (MILP) models applied to business intelligence applications. We provide background on the main underlying algorithmic method of branch-and-cut, which is based on the established optimization solution methods of branch-and-bound and cutting planes. The chapter also covers heuristic-based algorithms, which include preprocessing and probing strategies as well as the more advanced methods of local or neighborhood search for polishing solutions toward enhanced use in practical settings. Emphasis is given to both theory and implementation of the methods available. Other considerations are offered on parallelization, solution pools, and tuning tools, culminating with some concluding remarks on computational performance vis-à-vis business intelligence applications with a view toward perspective for future work in this area.
Keywords: integer programming; valid inequalities; local branching; relaxation induced neighborhood search (RINS); evolutionary algorithms; solution polishing (search for similar items in EconPapers)
JEL-codes: M15 (search for similar items in EconPapers)
References: Add references at CitEc
Citations:
Downloads: (external link)
https://www.intechopen.com/chapters/73051 (text/html)
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:ito:pchaps:208547
DOI: 10.5772/intechopen.93416
Access Statistics for this chapter
More chapters in Chapters from IntechOpen
Bibliographic data for series maintained by Slobodan Momcilovic ().