3 problems

Non-completeness conjecture. The IP-based model for {Sequencing to Minimize Tardy Tasks} is not $\textsf{NP-S}$-complete.

Let $\mu$ be the dodecahedron protocol, and let $g(C,\mu)$ and $\gamma_2(C,\mu)$ denote its verification quantities. An intelligent direction is a direction specified by the vector…

Let $M\geq3$ be an integer and let $0\leq C\leq1$. For the polygon protocol, $g(C,M)$ denotes its optimal verification value. Polygon protocol conjecture. … Numerical calculation i…