Norman Zadeh

发表

On Optimal Doubling in Backgammon

Norman Zadeh, Gary Kobliska, Norman Zadeh, 1977 .

Note---A Note on the Cyclic Coordinate Ascent Method

Norman Zadeh, 1970 .

What is the Worst Case Behavior of the Simplex Algorithm

Norman Zadeh, 1980 .

Near-Equivalence of Network Flow Algorithms.

Norman Zadeh, 1979 .

More pathological examples for network flow problems

Norman Zadeh, 1973, Math. Program..

On Doubling in Tournament Backgammon

Norman Zadeh, 1977 .

A bad network problem for the simplex method and other minimum cost flow algorithms

Norman Zadeh, Norman Zadeh, 1973, Math. Program..

Computation of Optimal Poker Strategies

Norman Zadeh, Norman Zadeh, 1977, Oper. Res..

On building minimum cost communication networks over time

Norman Zadeh, Norman Zadeh, 1974, Networks.

On building minimum cost communication networks

Norman Zadeh, Norman Zadeh, 1973, Networks.

Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

Norman Zadeh, Norman Zadeh, 1972, JACM.

Construction of efficient tree networks: The pipeline problem

Norman Zadeh, Norman Zadeh, 1973, Networks.