Questions tagged [packing]
Packing problems are a class of optimization problems in which one has to pack objects together as densely as possible. One could be for example packing rectangles inside a rectangle.
79
questions
1
vote
1
answer
76
views
First-Fit-Decreasing algorithm packs items of size at most 1 into bins of capacity 2
Consider the bin packing problem where we are given item sizes $a_1,\dots, a_n \in (0, 1)$, and all bins have capacity 2. The task is to pack the items in as few bins as possible, such that the total ...
0
votes
0
answers
20
views
Original paper for a linked-list based circular packing algorithm
A circular packing algorithm to pack an array of radii roughly into a circle was implemented by someone else but they do not remember the paper in which they took the algorithm from. All I know is ...
- 1
1
vote
1
answer
75
views
Ordered open-end knapsack problem optimised for minimum weight range
Given a fixed number of infinite-capacity containers and a list of items of varying weights, how can I best place the items into the containers preserving their original order in a way that minimises ...
- 113
1
vote
1
answer
62
views
Bin packing with more than one parameter
Usually, in bin-packing, we have objects of sizes $a_1,...a_n$, and each bin has size 1, We need to minimize the number of bins, and for this, there are best fit/first-fit approximation algorithms.
...
- 53
0
votes
0
answers
51
views
Bin Packing tight analysis lower bound?
I am having a problem understanding the following:
This is the background of the lemma:
To prove the lower bounds, we use the classical lower bound construction from [5, 9]. We
have an input instance ...
- 123
5
votes
1
answer
388
views
Nesting algorithm for rectangular-based, fixed-orientation polygons
I'm looking for an algorithm that is closely related to the 2-dimensional nesting problem (also known as lay planning, bin packing, and the cutting stock problem).
The main differences between this ...
- 151
1
vote
0
answers
62
views
Algorithm for modified 2D irregular bin packing
So usually bin packing algorithms compute the tightest packed solution. I want to calculate the opposite, in my case the solution with the most space between the packed objects is needed. I tried ...
- 111
1
vote
1
answer
270
views
Why is SET PACKING in NP?
I have seen an lot of proves why SET PACKING is NP complete. However, in every prove it states that SET PACKING is clearly in NP. It might be a stupid question, but is not so clear to me. I see that ...
- 13
2
votes
2
answers
144
views
Bin-packing with a capacity constraint on pairs of bins
In the classic bin-packing problem, we have to pack some positive integers into bins, such that the sum in each bin is at most some constant $B$, and subjet to this, the number of bins is minimum.
...
- 5,790
2
votes
0
answers
18
views
How to optimize the locations and orientations of a collection of irregular 3D objects?
I'm working on a project where I need to optimize both the locations and orientations of a collection of irregular 3D objects in a given simulation box.
To optimize the locations and orientations ...
- 121
0
votes
1
answer
169
views
Bin packing problem and optimality proof
Let $W$ be an array of weights. Store all the weights of $W$ in bins such that in each bin a heavier weight always go before a lighter weight (if $w_i\in W$ is stored before $w_j\in W$ then ...
- 115
8
votes
1
answer
154
views
What is the approximation ratio of this bin-backing algorithm?
Consider the following algorithm for bin packing:
Initially, sort the items by their size.
Put the largest item in a new bin.
Fill the bin with small items in ascending order of size, up to the ...
- 5,790
6
votes
2
answers
349
views
Can this special case of bin packing be solved in polynomial time?
Consider a multiset of $n$ integers, where each integer is between $1$ and $3 M$. The sum of all integers is $3 S$. There are three bins. The capacity of each bin is $C = S + M$.
Is there a polynomial-...
- 5,790
0
votes
1
answer
41
views
What's the name of this packing problem?
I'm trying to pack sets of intervals, to find distinct buckets of intervals. The buckets should not be overlapping.
For example if I have these intervals:
...
- 101
2
votes
1
answer
29
views
Optimize stacking time series by offsetting start times (feels like a backpack problem?)
Given a time-series of data collected from a single running process that takes 8 hours to complete:
Minute
GB of Disk Space Used
0
0
1
8
2
15
3
22
...Etc. It is sampled every minute, for 8 ...
- 123
4
votes
1
answer
102
views
Bin packing when items can be broken
In the bin packing problem, there are some $m$ items of size less than $1$, and they have to be packed into as few as possible bins of size $1$. The problem is NP-hard, but if we are allowed to break ...
- 5,790
4
votes
1
answer
139
views
One-dimensional packing problem: Optimal decomposition of music structure
I am currently working on my Master thesis on the visualization of music structure and I'm looking to find an optimal description of repetitions found in a piece of music.
Problem Description
Given a ...
0
votes
1
answer
24
views
Bin packing variant for maximizing value in a bin
I'm creating a tool where, given a list of N items that have a volume (v) and a price (p), ...
- 217
1
vote
1
answer
26
views
Optimal way to pack items with multidimensional weight such that the number of items is minimized?
I am given a set of items S = {a1,a2,a3,...,an}. Each item has a corresponding M dimensional bit vector indicating the properties of that item. For example, if item x has corresponding vector: {0, 1, ...
- 13
1
vote
0
answers
31
views
Additive approximation to bin packing
The bin packing problem is an NP-hard optimization problem that has many constant-factor approximation algorithms. I am looking for an additive approximation. I.e., given a set $I$ of items and bin ...
- 5,790
0
votes
0
answers
166
views
offline Bin Packing problem with multiple size bins
As per my research on stack overflow communities, This is probably known as cutting stock problem / multiple Knapsack problem (a variant of the bin packing problem) which is NP hard.
here are the ...
- 101
0
votes
1
answer
79
views
Why we can't have some algorithm to be polynomial if there are generic conditions that make them so?
I explain it better:
There are some algorithms that is clearly in NP, also NP-complete, but that under certain conditions they can be solved in polynomial time.
An example is Bin Packing, the decision ...
- 18
0
votes
1
answer
51
views
Approximate bin-packing?
Let $X_1,...X_n$ denote some bins, and $w_1,...w_m$ some positive real numbers, where $m \in \mathbb{N}$, and the order matters, so e.g. we can't switch the position of $w_n$ and $w_1$. The goal is to ...
0
votes
0
answers
41
views
Pack Paths [Concave and Convex]
I would like to design an algorithm to pack closed paths into a rectangle. An example of one of these paths is below:
The rectangle will have a fixed width, but the height will expand to accommodate ...
- 126
3
votes
0
answers
20
views
Optimal distribution of N points in non euclidean volume, where each point is furthest away from the others
Given N points, I want to find the optimal configuration for which all the points are as far away from each other as possible.
The metric I'm considering is an approximation to the perceived distance ...
- 131
1
vote
1
answer
75
views
packing with time-variant weights
This appears to be a knapsack / bin-packing problem, but I seem to have got stuck and could appreciate contributions.
Scenario 1: Tough (for me!)
There is a one day conference with a set of (4 or ...
- 113
2
votes
0
answers
182
views
Hexagon packing algorithm
I'm trying to pack hexagons, within bigger hexagons, as shown here:
For this example, I have 5 "children" to put in my "father" hexagon.
Each time I've got too many children, I would like to reduce ...
- 121
1
vote
1
answer
451
views
Reducing 3 SAT to 3 SET PACKING
I'm trying to prove NP-hardness of 3 SET PACKING, which is a following problem: given a family of sets where each set contains 3 elements, decide whether the family contains k sets that are pairwise ...
4
votes
1
answer
534
views
Greedy algorithm Packing problem
Assume that $A$ is the set of objects such that each object $x_i \in A$ has value $w_i$. We wish to pack these objects into group, each pack containing at least $k$ objects. Our goal is to minimize ...
user102344
0
votes
0
answers
63
views
A scheduling problem on an oriented graph with multiple constraints
The problem is the following :
Data
An oriented graph $(V, E)$ : to be understood as a set of partially ordered tasks
A map $d: V -> \mathbb{N}$ : to be understood a function mapping tasks to a ...
- 11
0
votes
0
answers
161
views
Multi Knapsack each with different constraints
It seems that there's no end to knapsack variations… here's the one I bumped into (at work):
There are:
N items, each with the usual value and weight properties.
M bins, each with an upper ...
- 99
2
votes
1
answer
90
views
How are the prime numbers encoded in Knuth's example of fitting primes into memory cache?
Could somebody please help me understand what is going on here (in plain English)? I think that $(k \mathbin{\&} 63)$ has the effect of modular division. Is that right? How are the primes encoded /...
- 145
1
vote
1
answer
110
views
Finding the maximum possible size of S, where S is a set of pairwise-disjoint subsets of the list, and every element of S sums to k
Say I had a list of numbers in the range of 1-20 for example: [5, 16, 17, 3, 2, 14, 4, 9, 11, 19], and an integer k (let's say k = 40)
How would I find the maximum possible size of S, where S is a ...
- 13
0
votes
0
answers
45
views
For a given shape, find set of points with the maximum average distance
Within some shape, I want to find a set of points where the distance between each point is maximized. This seems similar to sphere packing to me except that part of the sphere can be outside the shape....
- 1
3
votes
1
answer
70
views
Constructing an optimal solution to bin packing using a "magical function" $\phi$
I am taking an introductory course in complexity theory, and as an exercise, we were given the following problem.
Consider the bin packing problem, with objects of positive (rational) weights $W = \{...
- 33
2
votes
1
answer
583
views
Genetic algorithm - fit max circles inside box - what chromossomes?
I am using a genetic algorithm to fit the max number of circles into a box. Right now my cromossomes are both coordinates of the each circle. I am not sure how to crossover and mutate the x and y ...
- 25
0
votes
2
answers
159
views
Genetic Algorithm - Fit max circles inside box
I am using a genetic algorithm to find the best way to pack circles inside a box without each touching the others and filling as much space as possible. My doubt is if an individual from a generation ...
- 25
8
votes
1
answer
6k
views
Fitting different rectangles inside a rectangle
I have a fixed rectangle of size X x Y.
I also have a bunch of rectangles of different sizes.
I want to check if these rectangles can fit in the larger X x Y rectangles knowing that one can rotate ...
- 81
1
vote
1
answer
344
views
Bin packing with item weight constraint
In the bin packing problem, we are given a set of items I={a1,...,an}, each item with weight w_a1,...,w_an, and a set of n bins with B={b1,..., bn} all bins with capacity C. I want to restrict the ...
- 13
1
vote
1
answer
794
views
How to classify a 3D "Knapsack" problem where the only limitation is space, i.e. there is no weight constraint?
The problem is defined as: pack a 3D space with a given list of 3 types of cuboids which are each assigned a value, trying to either completely fill the space or to achieve the highest total value of ...
- 13
1
vote
1
answer
111
views
Group values up to a threshold and minimize groups
Given a threshold $t$ and a list of numbers $N$. $\forall n \in N: n \leq t$
Now group the numbers so that the sum of the numbers $s$ is lower or equal $t$. Minimize the amount of groups.
Example: $...
- 133
1
vote
2
answers
6k
views
Algorithm for packing various shapes inside of a rectangle
Say I am given a rectangle of width $W$ and length $L$. I now have to fit as many regular shapes of area $A$ into this rectangle as possible. For example, if the shape is a circle, I need to fit as ...
- 549
1
vote
2
answers
164
views
Non-trivial bin-packing instance with 5 objects
Bin packing problem is a problem, where one has to find the minimum number of bins of size $v$ required to store $n$ objects of sizes $s_1, \ldots, s_n$. Object sizes are never greater than $v$.
For ...
- 133
2
votes
1
answer
284
views
A problem similar to the Bin packing problem?
I'm working on a problem that is very similar to the bin packing problem, but for me, the objective is to minimize the maximum weight given m bins. The problem statement is:
Given n items, each with ...
- 21
1
vote
0
answers
261
views
Job scheduling and packing algorithm
I was thinking about developing a daily production work plan algorithm for an enterprise. The problem is as following:
There are various tasks that needs to be completed, each has a deadline, a ...
1
vote
0
answers
124
views
Schedule repeating jobs of fixed length and different weights
I have a scheduling problem that I am not sure is a known variant with known algorithms. It does appear like bin packing problem at first, but after imposing the constraints, I am not sure what it ...
- 280
0
votes
1
answer
357
views
What does a solution to the Rectangle-Fit problem look like?
I've been learning about NP-Complete problems, and came across the rectangle fit problem. Basically, the rectangle-fit problem is the problem of whether or not a set of 2d rectangles can fit in a ...
- 3
3
votes
1
answer
50
views
How to show that there are $\binom{M+K}{M}$ different number of type bins?
In textbook by Vazirani's textbook, chapter 9 about Bin Packing. He give the following lemma.
Lemma 9.4 Let $\epsilon >1$ be fixed, and let K be a fixed nonnegative integer. Consider the ...
- 289
2
votes
1
answer
118
views
route and/or packing optimization algorithm
What type of problem would this question fall under, are there known algorithms/heuristics for it, what would be good resources to learn more about solving it?
Given:
a list of items each with a ...
- 21
0
votes
1
answer
68
views
How can i fill shelves with products so that I have the maximum amount of sales?
I have to do a project where I write a greedy algorithm to maximize a company's sales. There are 6 shelves, each with 8m length. I have to position 100 items whose length, value and max sales ...
