Pavlo Glushko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pavlo Glushko has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Achim Koberstein
Volkswagen AG, Wolfsburg, Germany
1 shared publication - Csaba I. Fábián
Department of Informatics, GAMF, Faculty of Engineering and Computer Science, John von Neumann University, Kecskemét, Hungary
1 shared publication
Latest Publications
- Open Access
- 5 May 2022
- Published by Springer Nature in Computational Management Science
- Vol. 19 (4) , 539-565
An L-shaped method with strengthened lift-and-project cuts
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 mixed-binary stochastic problems with binary first-stage variables and continuous recourse. In particular, we show how L &P cuts derived for the master problem can be strengthened with the second-stage information. An adapted L-shaped algorithm and its computational efficiency analysis is presented. We show that the strengthened L &P cuts can significantly reduce the number of iterations and the solution time.
- 5 May 2022
- Published by Springer Nature in Computational Management Science
- Vol. 19 (4) , 539-565
Open AccessAn L-shaped method with strengthened lift-and-project cuts
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 mixed-binary stochastic problems with binary first-stage variables and continuous recourse. In particular, we show how L &P cuts derived for the master problem can be strengthened with the second-stage information. An adapted L-shaped algorithm and its computational efficiency analysis is presented. We show that the strengthened L &P cuts can significantly reduce the number of iterations and the solution time.