Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
Martí, R., & Reinelt, G. (2011). Branch-and-Cut. In Applied Mathematical Sciences (Switzerland) (Vol. 175, pp. 95–116). Springer. https://doi.org/10.1007/978-3-642-16729-4_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free