A counterexample to the assertion that the degree of difficulty of a geometric programming problem if #terms - #variables - 1 / / by Woolsey, Robert E. D., 1936-

Note on converting the 0-1 polynomial programming problem to a 0-1 linear program / by Glover, Fred, 1937-, Woolsey, Robert E. D., 1936-

Patrons must make an appointment to view Lib Use Only items

On the solution of geometric programs via separable programming / by Kochenberger, Gary A., Woolsey, Robert E. D., 1936-, McCarl, Bruce A.

Further reduction of zero-one polynomial programming problems to zero-one linear programming problems / by Glover, Fred, 1937-

Other Authors: “…Woolsey, Robert E. D., 1936-…”

Aggregating diophantine equations / by Glover, Fred, 1937-

Other Authors: “…Woolsey, Robert E. D., 1936-…”
Patrons must make an appointment to view Lib Use Only items

Metro Denver freight transportation study : a survey analysis /

Other Authors: “…Woolsey, Robert E. D., 1936-…”