scientific article; zbMATH DE number 3970525

MaRDI QIDQ3737231zbMATH OpenFDO

Authors Vasil S. Sgurev, V. S. Vasil'ev, Mariana N. Dzhelatova

Publication date 1982

zbMATH Keywords

average execution timebinary variablescomparison of algorithmscomputational efficiencytesting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09)

Recommendations

• An algorithm for nonlinear optimization problems with binary variables
• An algorithm for binary linear programming
• Numerical experiments in a new class of algorithms in linear programming
• scientific article; zbMATH DE number 2084733
• Parameterisation algorithms for the integer linear programs in binary variables
• Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• The bit-cost of some algorithms for the solution of linear systems
• An experimental investigation of enumerative methods for the linear complementarity problem
• Some experiments with Karmarkar's algorithm for linear programming

Cited in

(1)

• scientific article; zbMATH DE number 3970524 (Why is no real title available?)

This page was built for publication:

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