An integral transformation for integer programming problems

From MaRDI portal





It is shown that every integer programming problem can be transformed into an equivalent integer program with free variables in polynomial time. The transformation is advantageous because the equivalent problem it generates can be solved very easily in some restricted cases.











This page was built for publication: An integral transformation for integer programming problems

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