Type-1 zero-problem conjecture for 3M-DAPs
Statement
Let be a 3M-DAP. Write for the relevant row lengths, for the numbers of rows of types , and for their total values. A -pair consists of subsets of - and -rows with sizes and .
Type-1 zero-problem conjecture. If , then the optimal solution consists of -pairs with , with itself being one such pair, and the optimal value is
i.e. all values in must be .
The source presents this as a conjecture about the structure and value of optimal solutions for this class of 3M-DAPs. No resolution is supplied in the stated context.
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.