scientific article; zbMATH DE number 3908170

zbMATH Open0568.90071MaRDI QIDQ3686503FDOQ3686503

Authors: L. A. Kivistik 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4066620
• scientific article; zbMATH DE number 3428755
• The accelerated integer GCD algorithm
• scientific article; zbMATH DE number 3387119
• Improvements on the accelerated integer GCD algorithm
• scientific article; zbMATH DE number 3894836
• A generalization of Gosper's algorithm
• Parallel implementation of the accelerated integer GCD algorithm
• On algorithms to calculate integer complexity
• On Faster Integer Calculations Using Non-arithmetic Primitives

zbMATH Keywords

simplex algorithmaccellerationGomory's all-integer algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Cited In (7)

• Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Title not available (Why is that?)
• Title not available (Why is that?)
• The mixed cutting plane algorithm for all-integer programming
• Title not available (Why is that?)
• An advanced start algorithm for all-integer programming

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 Q3686503)