Gordon H. Bradley

According to our database, Gordon H. Bradley authored at least 9 papers between 1970 and 1998.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1998

Commentary - Dynamic, Distributed, Platform Independent OR/MS Applications - A Network Perspective.

Gordon H. Bradley, Arnold H. Buss

INFORMS J. Comput., 1998

1992

Network Assistant to Construct, Test, and Analyze Graph Network Algorithms.

Gordon H. Bradley, H. Fernandes Oliveira

Proceedings of the Computational Support for Discrete Mathematics, 1992

1974

Coefficient reduction for inequalities in 0-1 variables.

Gordon H. Bradley, Peter L. Hammer, Laurence A. Wolsey

Math. Program., 1974

1973

An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach.

Gordon H. Bradley, Pran N. Wahi

Oper. Res., 1973

Technical Note - Equivalent Mixed Integer Programming Problems.

Gordon H. Bradley

Oper. Res., 1973

1972

Reduction of integer programs to accelerate a multiple choice programming algorithm.

Gordon H. Bradley

Proceedings of the ACM annual conference, 1972

1971

Transformation of integer programs to knapsack problems.

Gordon H. Bradley

Discret. Math., 1971

1970

Algorithm 386: Greatest common divisor of n integers and multipliers.

Gordon H. Bradley

Commun. ACM, 1970

Algorithm and bound for the greatest common divisor of n integers.

Gordon H. Bradley

Commun. ACM, 1970