A note on a two dimensional knapsack problem with unloading constraints
نویسندگان
چکیده
منابع مشابه
A note on a two dimensional knapsack problem with unloading constraints
In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin B, and a list L of n rectangular items, each item with a class value in {1, . . . , C}. The problem is to pack a subset of L into B, maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item a, items with higher class values ...
متن کاملTwo Dimensional Strip Packing with Unloading Constraints
In this paper we present approximation algorithms for the two dimensional strip packing problem with unloading constraints. In this problem, we are given a strip S of width 1 and unbounded height, and n items of C different classes, each item ai with height h(ai), width w(ai) and class c(ai). As in the strip packing problem, we have to pack all items minimizing the used height, but now we have ...
متن کاملOn Two Dimensional Orthogonal Knapsack Problem
In this paper, we study the following knapsack problem: Given a list of squares with profits, we are requested to pack a sublist of them into a rectangular bin (not a unit square bin) to make profits in the bin as large as possible. We first observe there is a Polynomial Time Approximation Scheme (PTAS) for the problem of packing weighted squares into rectangular bins with large resources, then...
متن کاملThe three-dimensional knapsack problem with balancing constraints
In this paper we introduce a new Packing problem, the Three-Dimensional Knapsack Problem with Balancing Constraints (3BKP), the extension of the ThreeDimensional Knapsack Problem (3KP) where additional constraints related to the packing center of mass are given. The 3BKP consists in orthogonally packing a subset of threedimensional weighted items into a knapsack in order to maximize the total p...
متن کاملOn a Stochastic Bilevel Programming Problem with Knapsack Constraints
In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and clients. We assume the probability space to be discrete which allows us to reformulate the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2013
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2013037