An approximation scheme for the two-stage, two-dimensional knapsack problem

被引：3
|
作者：
Caprara, Alberto [1 ]
Lodi, Andrea [1 ]
Monaci, Michele [2 ]
机构：
[1] Univ Bologna, DEIS, I-40136 Bologna, Italy
[2] Univ Padua, DEIS, I-35131 Padua, Italy
来源：
DISCRETE OPTIMIZATION | 2010年 / 7卷 / 03期
关键词：
Knapsack problem; Shelf packing; Polynomial time approximation schemes; BIN PACKING; SUM;
D O I：
10.1016/j.disopt.2010.03.003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present an approximation scheme for the two-dimensional version of the knapsack problem which requires packing a maximum-area set of rectangles in a unit square bin, with the further restrictions that packing must be orthogonal without rotations and done in two stages. Achieving a solution which is close to the optimum modulo a small additive constant can be done by taking wide inspiration from an existing asymptotic approximation scheme for two-stage two-dimensional bin packing. On the other hand, getting rid of the additive constant to achieve a canonical approximation scheme appears to be widely nontrivial. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：114 / 124
页数：11
相关论文
共 50 条
  • [1] Faster approximation schemes for the two-dimensional knapsack problem
    Heydrich, Sandy
    Wiese, Andreas
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 79 - 98
  • [2] Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
    Heydrich, Sandy
    Wiese, Andreas
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (04)
  • [3] On the two-dimensional knapsack problem
    Caprara, A
    Monaci, M
    OPERATIONS RESEARCH LETTERS, 2004, 32 (01) : 5 - 14
  • [4] Fast approximation schemes for two-stage, two-dimensional bin packing
    Caprara, A
    Lodi, A
    Monaci, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (01) : 150 - 172
  • [5] Unconstrained two-dimensional knapsack problem
    Álvarez-Martínez, David
    Toro-Ocampo, Eliana Mirledy
    Gallego-Rendón, Ramón Alfonso
    Ingenieria y Universidad, 2010, 14 (02): : 327 - 344
  • [6] Two-stage general block patterns for the two-dimensional cutting problem
    Cui, Yaodong
    Zhang, Xianquan
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 2882 - 2893
  • [7] Two-Stage Submodular Maximization Under Knapsack Problem
    Liu, Zhicheng
    Jin, Jing
    Du, Donglei
    Zhang, Xiaoyan
    TSINGHUA SCIENCE AND TECHNOLOGY, 2024, 29 (06): : 1703 - 1708
  • [8] On the Two-Dimensional Knapsack Problem for Convex Polygons
    Merino, Arturo
    Wiese, Andreas
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (02)
  • [9] Improved approximation for two-dimensional vector multiple knapsack
    Cohen, Tomer
    Kulik, Ariel
    Shachnai, Hadas
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2025, 124-125
  • [10] Asymptotic two-stage two-dimensional quantizer
    Kawabata, T
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 152 - 152
12345