Add to ORKGInternational audienceImproving Lower Bounds for a Two-Dimensional Bin-Packing Problem by Generating New Data-Dependent Dual-Feasible Function
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
International audienceThe bin packing problem with conflicts (BPC) consists of minimizing the number...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
[Extrato] The concept of dual-feasible function (DFF) has been used to improve the resolution of sev...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
International audienceThe bin packing problem with conflicts (BPC) consists of minimizing the number...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We address the two-dimensional bin packing problem with fixed orientation. This problem requires pac...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuri...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
[Extrato] The concept of dual-feasible function (DFF) has been used to improve the resolution of sev...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...