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 条

[41] Two-stage two-dimensional guillotine cutting stock problems with usable leftover
Andrade, R.
Birgin, E. G.
Morabito, R.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (1-2) : 121 - 145
[42] Two-Dimensional Electron Model for a Hybrid Code of a Two-Stage Hall Thruster
Escobar, Diego
Ahedo, Eduardo
IEEE TRANSACTIONS ON PLASMA SCIENCE, 2008, 36 (05) : 2043 - 2057
[43] Approximation Algorithms for a Two-Phase Knapsack Problem
Nip, Kameng
Wang, Zhenbo
COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 63 - 75
[44] Two-stage random sequential adsorption of discorectangles and disks on a two-dimensional surface
Lebovka, Nikolai
Petryk, Mykhaylo
Tatochenko, Mykhailo O.
Vygornitskii, Nikolai V.
PHYSICAL REVIEW E, 2023, 108 (02)
[45] Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Lai, Xiangjing
Hao, Jin-Kao
Yue, Dong
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 35 - 48
[46] Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
Tonissen, D. D.
van den Akker, J. M.
Hoogeveen, J. A.
COMPUTERS & OPERATIONS RESEARCH, 2017, 83 : 125 - 139
[47] A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
Leung, Stephen C. H.
Zhang, Defu
Zhou, Changle
Wu, Tao
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 64 - 73
[48] An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem
Wu, Chenchen
Du, Donglei
Xu, Dachuan
ADVANCES IN GLOBAL OPTIMIZATION, 2015, 95 : 99 - 107
[49] STOCHASTIC APPROXIMATION METHODS FOR THE TWO-STAGE STOCHASTIC LINEAR COMPLEMENTARITY PROBLEM
Chen, Lin
Liu, Yongchao
Yang, Xinmin
Zhang, Jin
SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (03) : 2129 - 2155
[50] Exact algorithms for the two-dimensional guillotine knapsack
Dolatabadi, Mohammad
Lodi, Andrea
Monaci, Michele
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 48 - 53

← 1 2 3 4 5 →