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 apply the PTAS to the problem of packing squares with profits into a rectangular bin and get a 6 5 + ǫ approximation algorithm.
منابع مشابه
FORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM
Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملA New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
Abst rac t . The d-dimensional orthogonal knapsack problem (OKP) has a wide range of practical applications, including packing, cutting, and scheduling. We present a new approach to this problem, using a graphtheoretical characterization of feasible packings. This characterization allows us to deal with classes of packings that share a certain combinatorical structure, instead of single ones. C...
متن کاملSolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملApproximating the Orthogonal Knapsack Problem for Hypercubes
Given a list of d-dimensional cuboid items with associated profits, the orthogonal knapsack problem asks for a packing of a selection with maximal profit into the unit cube. We restrict the items to hypercube shapes and derive a ( 5 4 + )-approximation for the twodimensional case. In a second step we generalize our result to a ( 2 +1 2d + )approximation for d-dimensional packing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0803.4260 شماره
صفحات -
تاریخ انتشار 2008