Nimrod Megiddo

1
h-index
1
Publications
101
Citations

Publications

1 shown

On Finding Primal- and Dual-Optimal Bases

We show that if there exists a strongly polynomial time algorithm that finds a basis which is optimal for both the primal and the dual problems, given an optimal solution for on...

1991 INFORMS Journal on Computing 101 citations

Researcher Info

h-index
1
Publications
1
Citations
101
Institution
Tel Aviv University

External Links

Impact Metrics

h-index 1

h-index: Number of publications with at least h citations each.

Academic Output Over Time