Alan J. Goldman

According to our database, Alan J. Goldman authored at least 12 papers between 1967 and 1995.

Collaborative distances:

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

1995

Some geometric results in semidefinite programming.

Motakuri Ramana, Alan J. Goldman

J. Glob. Optim., 1995

1993

The isolation game for regular graphs.

A. G. Robinson, Alan J. Goldman

Discret. Math., 1993

1991

On the Set of Optimal Points to the Weber Problem.

Zvi Drezner, Alan J. Goldman

Transp. Sci., 1991

On Ringeisen's isolation game II.

A. G. Robinson, Alan J. Goldman

Discret. Math., 1991

1990

On the set coincidence game.

A. G. Robinson, Alan J. Goldman

Discret. Math., 1990

On ringeisen's isolation game.

A. G. Robinson, Alan J. Goldman

Discret. Math., 1990

1989

The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies.

A. G. Robinson, Alan J. Goldman

J. Comput. Syst. Sci., 1989

1987

Technical Note - Recognizing Unbounded Integer Programs.

Richard H. Byrd, Alan J. Goldman, Miriam Heller

Oper. Res., 1987

1986

Allowable processing orders in the accelerated cascade algorithm.

Alan J. Goldman, Prasoon Tiwari

Discret. Appl. Math., 1986

1983

Technical Note - Linearization in 0-1 Variables: A Clarification.

Alan J. Goldman

Oper. Res., 1983

1968

Letter to the Editor - Fractional Container-Loads and Topological Groups.

Alan J. Goldman

Oper. Res., 1968

1967

A Transport Improvement Problem Transformable to a Best-Path Problem.

Alan J. Goldman, George L. Nemhauser

Transp. Sci., 1967