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
关键词
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 条
  • [31] Two-dimensional object recognition through two-stage string matching
    Wu, WY
    Wang, MJJ
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (07) : 978 - 981
  • [32] Improved approximation algorithms for two-stage flowshops scheduling problem
    Wu, Guangwei
    Chen, Jianer
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2020, 806 : 509 - 515
  • [33] DISCRETE APPROXIMATION OF LINEAR TWO-STAGE STOCHASTIC PROGRAMMING PROBLEM
    LEPP, R
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1987, 9 (1-2) : 19 - 33
  • [34] Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
    Ye, Deshi
    Zhang, Guochuan
    COMPUTING AND COMBINATORICS, 2015, 9198 : 390 - 401
  • [35] Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
    de Queiroz, Thiago Alves
    Del Bianco Hokama, Pedro Henrique
    Saliba Schouery, Rafael Crivellari
    Miyazawa, Flavio Keidi
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 105 : 313 - 328
  • [36] Approximation algorithms for the two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 177 - 184
  • [37] SPECTRAL TAU APPROXIMATION OF THE TWO-DIMENSIONAL STOKES PROBLEM
    LANDRIANI, GS
    NUMERISCHE MATHEMATIK, 1988, 52 (06) : 683 - 699
  • [38] Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem
    Kang, Suho
    Kim, Junyoung
    Joung, Seulgi
    Lee, Kyungsik
    OPTIMIZATION LETTERS, 2024,
  • [39] A TWO-DIMENSIONAL GLIMM TYPE SCHEME ON CAUCHY PROBLEM OF TWO-DIMENSIONAL SCALAR CONSERVATION LAW
    Kan, Hui
    Yang, Xiaozhou
    ACTA MATHEMATICA SCIENTIA, 2017, 37 (01) : 1 - 25
  • [40] Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
    Kwon, Sue-Jeong
    Joung, Seulgi
    Lee, Kyungsik
    COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 159 - 169