Orientational variable-length strip covering problem: A branch-and-price-based algorithm
Eur. J. Oper. Res., pp. 254-269, 2021.
EI
Abstract:
Abstract In this article, we study a challenging optimization problem, namely the orientational variable-length strip covering problem. Given a large rectangular region and multiple orientational strips with variable lengths, the strips should be positioned and their lengths be determined such that their union can cover the large region...More
Code:
Data:
Tags
Comments