6533b857fe1ef96bd12b42e0

RESEARCH PRODUCT

Branch-and-Cut

Gerhard ReineltRafael Martí

subject

Mathematical optimizationLinear programmingSeparation algorithmComputer scienceCombinatorial optimization problemBranch and cut

description

This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.

yearjournalcountryeditionlanguage
2010-09-12
https://doi.org/10.1007/978-3-642-16729-4_5