Gerald L. Thompson

According to our database, Gerald L. Thompson authored at least 27 papers between 1969 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2006

An improved column subtraction method.

J. K. Loots, T. H. C. Smith, Gerald L. Thompson

South Afr. Comput. J., 2006

2002

An Integral Simplex Algorithm for Solving Combinatorial Optimization Problems.

Gerald L. Thompson

Comput. Optim. Appl., 2002

1998

Finding Postal Carrier Walk Paths in Mixed Graphs.

Hong Yan, Gerald L. Thompson

Comput. Optim. Appl., 1998

1996

Exchanging heterogeneous goods via sealed bid auctions and transportation systems.

Gerald L. Thompson, Sten Thore

Ann. Oper. Res., 1996

Preface.

Gerald L. Thompson, Sten Thore

Ann. Oper. Res., 1996

1995

A Parallel Implementation of the Column Subtraction Algorithm.

T. H. C. Smith, Gerald L. Thompson

Parallel Comput., 1995

1994

A Computational Study of Satisfiability Algorithms for Propositional Logic.

Farid Harche, John N. Hooker, Gerald L. Thompson

INFORMS J. Comput., 1994

The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems.

Farid Harche, Gerald L. Thompson

Comput. Oper. Res., 1994

1993

A mixed-initiative scheduling workbench integrating AI, OR and HCI.

Wen Ling Hsu, Michael J. Prietula, Gerald L. Thompson, Peng Si Ow

Decis. Support Syst., 1993

Decision horizons for the capacitated lot size model with inventory bounds and stockouts.

Richard A. Sandbothe, Gerald L. Thompson

Comput. Oper. Res., 1993

1991

A hybrid heuristic for the facilities layout problem.

Bharat K. Kaku, Gerald L. Thompson, Thomas E. Morton

Comput. Oper. Res., 1991

1990

A Forward Algorithm for the Capacitated Lot Size Model with Stockouts.

Richard A. Sandbothe, Gerald L. Thompson

Oper. Res., 1990

Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations.

T. H. C. Smith, T. W. S. Meyer, Gerald L. Thompson

Discret. Appl. Math., 1990

1987

A Dynamic Space-Time Network Flow Model for City Traffic Congestion.

Daniel J. Zawack, Gerald L. Thompson

Transp. Sci., 1987

A network approach to cohort personnel planning using cross-sectional data.

Cheryl Gaimon, Shantha Mohan, Gerald L. Thompson

Comput. Oper. Res., 1987

1986

Solution of constrained generalized transportation problems using the pivot and probe algorithm.

Gerald L. Thompson, Awanti P. Sethi

Comput. Oper. Res., 1986

1985

A successful algorithm for the undirected Hamiltonian path problem.

Gerald L. Thompson, Sharad Singhal

Discret. Appl. Math., 1985

1984

The pivot and probe algorithm for solving a linear program.

Awanti P. Sethi, Gerald L. Thompson

Math. Program., 1984

A study of the bottleneck single source transportation problem.

Robert V. Nagelhout, Gerald L. Thompson

Comput. Oper. Res., 1984

1980

A single source transportation algorithm.

Robert V. Nagelhout, Gerald L. Thompson

Comput. Oper. Res., 1980

1977

Cost operator algorithms for the transportation problem.

V. Srinivasan, Gerald L. Thompson

Math. Program., 1977

A Simplex-Like Algorithm for the Continuous Modular Design Problem.

Timothy L. Shaftel, Gerald L. Thompson

Oper. Res., 1977

1973

Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm.

V. Srinivasan, Gerald L. Thompson

J. ACM, 1973

An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems.

V. Srinivasan, Gerald L. Thompson

Oper. Res., 1973

1972

Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems.

V. Srinivasan, Gerald L. Thompson

J. ACM, 1972

1971

Roots of Matrix Pencils: The Generalized Eigenvalue Problem [F2] (Algorithm 405).

Alice M. Dell, Roman L. Weil, Gerald L. Thompson

Commun. ACM, 1971

1969

An Algorithm for Finding a Minimum Equivalent Graph of a Digraph.

Dennis M. Moyles, Gerald L. Thompson

J. ACM, 1969