Strongly polynomial algorithm for solving the general problem of least modules

MaRDI QIDQ3162013zbMATH OpenFDO

Authors V. V. Mironov

Publication date 18 October 2010

zbMATH Keywords

complexity of algorithmsleast modules

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A strongly polynomial algorithm for linear systems having a binary solution
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• scientific article; zbMATH DE number 4156204
• scientific article; zbMATH DE number 4016589
• Towards a Genuinely Polynomial Algorithm for Linear Programming

Cited in

(1)

• Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S

This page was built for publication: Strongly polynomial algorithm for solving the general problem of least modules

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