14 problems

Projected-stationarity conjecture. For every $H\geq 2$, the complete Das–Dennis grid $G_H$ is projected-stationary for anchored-box magnitude on $\Delta_2$. More precisely:

After introducing the inverse robustness variable $r$ and reformulating the radiotherapy-planning QCQP as a semidefinite-programming relaxation, the sandwiching algorithm can be ap…

Uniqueness conjecture. If

Soland's conjecture. The lemma asserting that every properly efficient decision admits a continuous, strictly increasing and strictly concave real-valued function $v$ on…

Let algorithms for multiobjective optimization be evaluated using hypervolume and other performance criteria, including spatial diversity and the number of positive samples. Hyperv…

Efficient-basis coverage conjecture. Every efficient basis for is efficient for at least one of the problems or.

Let $\mathcal{V}$ be the vertex set of a discretizable distance geometry problem, let $rank$ assign vertices to ranks, and let $nodes(rank(v))$ denote the number of nodes at the ra…

Archive-gap advantage conjecture. The advantage on the archive gap is due to (i) the large stationary variance obtained with non-elitist evolution strategies and (ii) the fitness a…

Elliptical Pareto-critical-set conjecture. The ellipse parametrized by $\bar{x}^j=(a\cos(2\pi j/N),b\sin(2\pi j/N))^\top$ can be represented as the Pareto critical set of this poly…

The discussion concerns output-sensitive enumeration algorithms for multiobjective linear programs (MOLPs), where $d$ denotes the number of objectives and the running time is measu…

Let $w$ be the weight vector defining the weighted objective value $\langle w,f(x)\rangle$ for solutions $x$ of the Two-Parabolas problem, and let $g_{min}$ denote the minimum eige…

Subset preservation conjecture. Under these hypotheses, such a set $X$ exists. The claim would provide a simultaneous value guarantee for a constant number of monotone submodular o…

Let $f_1,\dots,f_l$ be a fixed number of monotone submodular functions on a ground set $N$. Greedy generalization conjecture. The greedy algorithm can be generalized to work for mu…

Barycenter conjecture. In higher dimensions, the point of tangency is the barycenter of $U$.