Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.

Algorithms

Branch-Cut-And-Price (BCP)

Users: 1 - Average Rating: 5.00


In many mixed integer programs there is some embedded problem structure which can be exploited, often by a decomposition. When the relaxation in each node of a branch-and-bound tree is solved by column generation, one speaks of branch-and-price. Optionally, cutting planes can be added in order to strengthen the relaxation, and this is called branch-price-and-cut.

Scientific Area:
C++, Python

Language/Environments:
Optimization

Target Group:
Basic


Cite as:
Desrosiers, J., & L├╝bbecke, M. E. (2011). Branch-price-and-cut algorithms. Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, 109-131.

Author of the review:
Ivo Nowak
HAW Hamburg


Reviews

You have to login to leave a comment. If you are not registered click here