Answers are grounded in this paper and cite their sources.
In this paper we show that mixed-integer linear programming is solvable in strongly polynomial time if the constraint matrix is totally unimodular with at most two nonzero entries in every row. This is done by reducing the problem to an instance of minimization of an L-convex function.
No takes yet. Share an insight, caveat, or question.
Giacomo Zambelli (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: