All Questions
2
questions
0
votes
1
answer
31
views
A variant of the partition problem or subset sum problem
Given a target list $T = (t_1, t_2, \ldots, t_N)$ and a multiset $S = \{s_1, s_2, \ldots, s_M\}$, both with non-negative integer elements, $t_k\in \mathbb{N}_>$ and $s_k\in \mathbb{N}_>$, ...
1
vote
0
answers
127
views
Minimizing the magnitude of the sum of a vector of complex numbers with an integer constraint
Let $h_{1}, ..., h_{N} \in \mathbb{C} $
Consider minimizing the function below:
$ \min \left| \sum\limits_{i=1}^N h_{i} x_{i} \right| $
with the constraints $x_{i}^2 = 1$
i.e., $x_{i}$ can only take ...