arXiv · 2611.14045
Mixed-integer dual network problems are solvable in strongly polynomial time
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Giacomo Zambelli. 2026-11-10. Mixed-integer dual network problems are solvable in strongly polynomial time. https://searcharxiv.com/abs/2611.14045
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.