Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
270 views

Generalized assignment problem with no integrality gap

Suppose I am solving the generalized assignment problem, so that I am given matrices $U$ and $W$ and a vector $c$ (all three of which have, say, positive entries), and I want to solve $$\text{...
Kevin Jenkins's user avatar
1 vote
0 answers
493 views

Complexity of Nested Linear Optimization

My question is motivated by the fact, that among other ways, it is possible to restrict a variable to two discrete values, e.g. the prototypical $0$ and $1$, via an optimization constraint: $$\max(\...
Manfred Weis's user avatar
  • 13.2k
4 votes
2 answers
2k views

Simplified knapsack problem

There is a problem that I can not solve. Given a set of items (each item has some integer weight) we have to fill bag with some number of copies of these items, with the only restriction that the ...
Leo-guest's user avatar
13 votes
2 answers
664 views

Complexity of a weirdo two-dimensional sorting problem

Please forgive me if this is easy for some reason. Suppose given $S$, a set of $n^2$ points in $\mathbb{R}^2$. I want to choose a bijective map $f$ from $S$ to the set of lattice points in $\lbrace ...
JSE's user avatar
  • 19.2k