Scholarlink

<p>We propose an approach to reduce the computational complexity of solving the nonguillotine packing problem for a set of rectangular items on a half-strip. The approach is based on constructing an exact mathematical model as a high-dimensional partially Boolean linear programming problem. The main tool is the decomposition of this high-dimensional problem into a sequence of problems of acceptable dimensionality.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

REDUCTION OF COMPUTATIONAL COMPLEXITY FOR SOLVING THE NONGUILLOTINE PLACEMENT PROBLEM BASED ON AN EXACT MODEL

  • 期刊论文

  • 发表日期：

    2026年6月24日

查看全文
  • Anastasiya Andrianova

摘要

We propose an approach to reduce the computational complexity of solving the nonguillotine packing problem for a set of rectangular items on a half-strip. The approach is based on constructing an exact mathematical model as a high-dimensional partially Boolean linear programming problem. The main tool is the decomposition of this high-dimensional problem into a sequence of problems of acceptable dimensionality.