Mehdi Mrad, Tamer G. Ali, Ali Balma, A. Gharbi, Ali Samhan, M. Louly
{"title":"Impact of Graph Compression on Solving the Two-Dimensional Strip Cutting Problem","authors":"Mehdi Mrad, Tamer G. Ali, Ali Balma, A. Gharbi, Ali Samhan, M. Louly","doi":"10.1109/scc53769.2021.9768351","DOIUrl":null,"url":null,"abstract":"We address the problematic of cutting m rectangular items from a two-dimensional strip. Each item has a given width, height, and demand. The purpose is to minimize the height of the used strip, while respecting the two stages of guillotine cuts. We consider the arc-flow formulation for this NP-hard problem and propose to enhance it using graph compression techniques. Computational results on real-world data show a consistently promising impact of the graph compression in terms of computation time and graph size.","PeriodicalId":365845,"journal":{"name":"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/scc53769.2021.9768351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We address the problematic of cutting m rectangular items from a two-dimensional strip. Each item has a given width, height, and demand. The purpose is to minimize the height of the used strip, while respecting the two stages of guillotine cuts. We consider the arc-flow formulation for this NP-hard problem and propose to enhance it using graph compression techniques. Computational results on real-world data show a consistently promising impact of the graph compression in terms of computation time and graph size.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
