A Comparison of Three Algorithms for Linear Zero-One Programs

Authors:
A. Mahendrarajah;F. Fiala
Affiliations:
Department of Mathematics, Carleton University, Ottawa, Ont., Canada;Department of Mathematics, Carleton University, Ottawa, Ont., Canada
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1976

Citing 5
Cited 1

Algorithm 449: solution of linear programming problems in 0-1 variables

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

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

Communications of the ACM
Analysis of algorithms for the zero-one programming problem

Communications of the ACM
Computational experience with a modification of an algorithm by Hammer and Rudeanu for 0-1 linear programming

ACM '71 Proceedings of the 1971 26th annual conference

Recommendation systems with complex constraints: A course recommendation perspective

ACM Transactions on Information Systems (TOIS)

Quantified Score

Hi-index	0.00

Visualization

Abstract