IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v20y2022i1d10.1007_s10288-020-00469-4.html
   My bibliography  Save this article

A note on the integrality gap of cutting and skiving stock instances

Author

Listed:
  • John Martinovic

    (Technische Universität Dresden)

Abstract

In this paper, we consider the (additive integrality) gap of the cutting stock problem (CSP) and the skiving stock problem (SSP). Formally, the gap is defined as the difference between the optimal values of the ILP and its LP relaxation. For both, the CSP and the SSP, this gap is known to be bounded by 2 if, for a given instance, the bin size is an integer multiple of any item size, hereinafter referred to as the divisible case. In recent years, some improvements of this upper bound have been proposed. More precisely, the constants 3/2 and 7/5 have been obtained for the SSP and the CSP, respectively, the latter of which has never been published in English language. In this article, we introduce two reduction strategies to significantly restrict the number of representative instances which have to be dealt with. Based on these observations, we derive the new and improved upper bound 4/3 for both problems under consideration.

Suggested Citation

  • John Martinovic, 2022. "A note on the integrality gap of cutting and skiving stock instances," 4OR, Springer, vol. 20(1), pages 85-104, March.
    • Handle: RePEc:spr:aqjoor:v:20:y:2022:i:1:d:10.1007_s10288-020-00469-4
    DOI: 10.1007/s10288-020-00469-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-020-00469-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-020-00469-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    2. Martinovic, J. & Scheithauer, G., 2016. "Integer linear programming models for the skiving stock problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 356-368.
    3. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
    4. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    5. Guntram Scheithauer, 2018. "One-Dimensional Cutting Stock," International Series in Operations Research & Management Science, in: Introduction to Cutting and Packing Optimization, chapter 0, pages 73-122, Springer.
    6. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    7. L. V. Kantorovich, 1960. "Mathematical Methods of Organizing and Planning Production," Management Science, INFORMS, vol. 6(4), pages 366-422, July.
    8. Harald Dyckhoff, 1981. "A New Linear Programming Approach to the Cutting Stock Problem," Operations Research, INFORMS, vol. 29(6), pages 1092-1104, December.
    9. Scheithauer, Guntram & Terno, Johannes, 1995. "The modified integer round-up property of the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 562-571, August.
    10. Vadim M. Kartak & Artem V. Ripatti, 2019. "Large proper gaps in bin packing and dual bin packing problems," Journal of Global Optimization, Springer, vol. 74(3), pages 467-476, July.
    11. Guntram Scheithauer, 2018. "Introduction to Cutting and Packing Optimization," International Series in Operations Research and Management Science, Springer, number 978-3-319-64403-5, April.
    12. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    13. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
    2. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    3. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie & Andreas Fischer, 2019. "Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation," 4OR, Springer, vol. 17(2), pages 173-200, June.
    4. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
    5. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    6. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    7. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    8. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    9. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    10. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    11. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    12. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    13. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    14. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    15. Katrin Heßler & Stefan Irnich & Tobias Kreiter & Ulrich Pferschy, 2020. "Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System," Working Papers 2009, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    16. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    17. Katrin Heßler & Timo Gschwind & Stefan Irnich, 2017. "Stabilized Branch-and-Price Algorithms for Vector Packing Problems," Working Papers 1713, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Mateus Martin & Horacio Hideki Yanasse & Luiz Leduíno Salles-Neto, 2022. "Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 557-582, August.
    19. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
    20. Mathijs Barkel & Maxence Delorme, 2023. "Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 475-494, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:aqjoor:v:20:y:2022:i:1:d:10.1007_s10288-020-00469-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.