All Questions
11
questions
2
votes
0
answers
73
views
Bin packing : item to be packed in a certain bin depend on previously packed items to that bin.
I am working on an engineering problem. I need to implement an algorithm that looks like a certain variant of bin packing. Specifically, in this variant of the bin packing, the size of a certain item ...
1
vote
2
answers
105
views
Bin packing with load fairness across the bins
The bin pack problem denotes the process of assigning a set of n items into a minimal number of bins of capacity c. It can be simply formulated as an ILP as per the below description:
My question is :...
0
votes
1
answer
78
views
How to solve this mathematical programming problem?
Suppose each point in the interval $[0,1]$ has some of a set of $N$ properties. The total length of the intervals with property $i$ is $x_i$ ($0\le x_i \le 1$).
Questions:
What is the maximum and ...
1
vote
1
answer
155
views
Filling a square grid with non-negative integers with constraints
This question can be considered as a generalization of this question (which was not answered).
Set-up
Consider we have a square grid of $N_x \times N_y$ sites with a non-negative integer $S_{ij}$ on ...
3
votes
0
answers
947
views
Determining Canonical Coin Systems of Five Coins
I need to check whether a given coin system of five coins, $\$ = <1,c_2,c_3,c_4,c_5>$, is canonical, that is, a system in which the greedy algorithm provides the way to make change using the ...
0
votes
1
answer
191
views
Algorithm to find integer combinations satisfying a set of inequalities
I have an engineering problem that is reduced to finding a set of positive integer combinations satisfying several inequalities and some other properties.
Specially, let $\mathcal{S}$ be the set of ...
2
votes
1
answer
562
views
Assignment with pair-wise constraints
Consider the assignment problem where we have two groups $u = {1, \ldots, n}$ and $v = {1, \ldots, n}$. The task is to assign each of the elements of $u$ to one and only element in $v$, such that the ...
1
vote
1
answer
81
views
Math problem of selecting jobs amongst skilled employees
I was wondering if anyone has ever come across a mathematical problem of this nature before:
Suppose that you are a manager working with a large team of $n$ people. These $n$ people have been trained ...
2
votes
0
answers
146
views
Traverse resultant 2D array after integer partition
I have used the solution of integer partitioning using dynamic programming explained in this post and in this article.
Following is the resultant matrix when $N$ is equal to $6$:
$$\begin{bmatrix}
...
1
vote
1
answer
134
views
organizing rectangles on top of each other
We have some rectangles that should be organized in a number of columns. Each column height should be in the range of $[H, H+d]$ in which $d$ is a small number relative to the height of the rectangles....
1
vote
0
answers
354
views
Strange but practical Bin packing problem
I am trying to solve the following MILP through LP solve. A link for the original problem is here
I am re-iterating the problem as follows:
I am trying to write an application that generates drawing ...