Polynomial-time solvability of integer knapsacks in the diagonal Frobenius cone
Statement
Let be an integer matrix with columns , let
and set . Let denote the integer knapsack polytope, and let be the diagonal Frobenius number, namely the minimal such that every makes contain an integer point. Polynomial-time solvability conjecture. The problem is solvable in polynomial time for all instances with
The feasible translated cone guarantees that the knapsack polytope contains an integer point for every right-hand side in the specified region, and the conjecture asks whether this structural promise yields a polynomial-time algorithm. The source provides no resolution, so the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.