Work

Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem

Year: 2024

Type: article

Abstract: In this study, we theoretically compare integer programming models for the two-dimensional two-staged knapsack problem. Including the well-known level packing model, we introduce two pattern-based models called the strip packing model and the staged pattern model derived from integer programming models for the two-dimensional two-staged cutting stock problem. We show that the level packing model provides weaker linear programming (LP) relaxation bounds than pattern-based models. Furthermore, we also present upper bounds on the LP-relaxation bound of the level packing model, which can be obtained from the LP-relaxation bounds of the pattern-based models.

Source: Optimization Letters

DOI: 10.1007/s11590-024-02164-3

Authors: Suho Kang, Junyoung Kim, Seulgi Joung, Kyungsik Lee

Institutions: Seoul National University, Myongji University, Ajou University

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funders: Seoul National University, National Research Foundation of Korea