An algorithm for binary linear programming

MaRDI QIDQ2833817zbMATH OpenFDO

Authors Subhendu Das

Publication date 25 November 2016

Published in Journal of Applied Mathematics and Bioinformatics (Search for Journal in Brave)

zbMATH Keywords

optimizationinteger programmingsimplex methodbinary programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3314879
• A strongly polynomial algorithm for linear systems having a binary solution
• Publication:4723568
• Improvement of binary integer programming through employment of the Boolean algebra logic
• A meta-control algorithm for generating approximate solutions to binary integer programming problems

Cited in

(5)

• scientific article; zbMATH DE number 1263753 (Why is no real title available?)
• Binary solutions for overdetermined systems of linear equations
• Improvement of binary integer programming through employment of the Boolean algebra logic
• scientific article; zbMATH DE number 3970524 (Why is no real title available?)
• scientific article; zbMATH DE number 3970525 (Why is no real title available?)

This page was built for publication: An algorithm for binary linear programming

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