{
  "abstract": "This paper introduces the two-dimensional flexible stock size cutting stock problem (2D-FSSCSP), where stocks of flexible (bounded) sizes are available. The problem consists of cutting a set of smaller rectangular items, each with given dimensions, from a set of larger rectangular plates with bounded height and width. Cutting patterns are restricted to twostage non-exact guillotine cuts and are subject to two-dimensional constraints. The objective is to minimize the total amount of used materials. The 2D-FSSCSP is first formulated using three mixed integer linear programming models: item-, strip-, and pattern-based. Different dominance properties and lower and upper bounds of the 2D-FSSCSP were considered to reduce the search space. To handle large-scale instances, a large neighborhood search (LNS) is employed. The LNS framework eliminates a few patterns and reconstructs new ones by solving subproblems such as the minimum waste pattern problem. We evaluate these approaches using newly generated instances. The numerical results enable us to analyze and evaluate the impact of different modeling strategies for managing stock-size flexibility in this variant of the 2D-CSP.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "name": "Khadija Hadj Salem"
    },
    {
      "name": "Alexis Robbes"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5wbkhtzhz46xt.bib",
  "cited_by": 0,
  "doi": "10.1016/j.ejor.2026.08.023",
  "fulltext_url": null,
  "id": "5wbkhtzhz46xt",
  "issns": [
    "0377-2217",
    "1872-6860"
  ],
  "landing_url": "https://hal.science/hal-05734367v1",
  "language": "en",
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.info"
    ],
    [
      "hal",
      "0.math"
    ],
    [
      "hal",
      "1.info.info-ro"
    ],
    [
      "hal",
      "1.math.math-co"
    ],
    [
      "openalex",
      "2209|Optimization and Packing Problems"
    ]
  ],
  "openalex": "W7203675068",
  "pdf_url": "https://hal.science/hal-05734367/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-18",
  "publisher": "Elsevier",
  "ris": "https://research.draconitic.com/paper/5wbkhtzhz46xt.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:24Z",
      "native_id": "hal-05734367",
      "source": "hal",
      "url": "https://hal.science/hal-05734367v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:1.math.math-co",
      "subfield": "combinatorics"
    }
  ],
  "title": "A large neighborhood search matheuristic for the two-dimensional guillotine flexible stock size cutting stock problem",
  "title_text": "A large neighborhood search matheuristic for the two-dimensional guillotine flexible stock size cutting stock problem",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:17:24Z",
  "url": "https://research.draconitic.com/paper/5wbkhtzhz46xt",
  "venue": "European Journal of Operational Research",
  "versions": []
}