L. G. Proll – Communications of the ACM

Research and Advances Oct 1 1974

A computer routine for quadratic and linear programming problems

Author Archives

Research and Advances Jun 1 1972

Research and Advances Jan 1 1971

Further evidence for the analysis of algorithms for the zero-one programming problem

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated.

Research and Advances Aug 1 1970

Remark on Algorithm 233: Simpson’s rule for multiple integration

Research and Advances May 1 1970

Certification of algorithm 263A [H]

Research and Advances Dec 1 1969

Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration

Research and Advances Nov 1 1968

Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved