On the Computational Complexity of Bilevel Integer Linear Programming

From MaRDI portal

MaRDI QIDQ7333144arXivFDO

Authors Nagisa Sugishita, Margarida Carvalho

Publication date 2026

Published in arXiv


arXiv classification

math.OC















This page was built for publication: On the Computational Complexity of Bilevel Integer Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7333144)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_Computational_Complexity_of_Bilevel_Integer_Linear_Programming&oldid=107872313"
Powered by MediaWiki