Showing 1 - 10 of 108
Persistent link: https://www.econbiz.de/10009260975
Persistent link: https://www.econbiz.de/10010222412
Persistent link: https://www.econbiz.de/10008737704
Persistent link: https://www.econbiz.de/10009273379
Persistent link: https://www.econbiz.de/10011341390
Persistent link: https://www.econbiz.de/10011989130
Lift-and-project (L &P) cuts are well-known general 0–1 programming cuts which are typically deployed in branch-and-cut methods to solve MILP problems. In this article, we discuss ways to use these cuts within the framework of Benders' decomposition algorithms for solving two-stage...
Persistent link: https://www.econbiz.de/10015199553
Persistent link: https://www.econbiz.de/10013447491
Persistent link: https://www.econbiz.de/10000898053
Persistent link: https://www.econbiz.de/10009766807