4 problems

Coppersmith–Sorkin rank-one conjecture. The expected value of the minimum $k$-assignment of $X$ is

Sparse assignment conjecture. There exists $\kappa\in[0,1]$, depending on $a$ and $c$, such that

Let $x_1<\ldots<x_n$ and $y_1<\ldots<y_n$ be real numbers, let $\alpha>0$, and define … for permutations $\sigma\in S_n$. The assignment problem is to maximize $F_\sigma(x,y)$ over…

COVP characterization conjecture. A feasible instance of the $(4,2)$-AP with cost array $C$ of size $n\neq 3$ has the COVP if and only if $C$ is sum-decomposable with parameters…