Prabhu N.

N. Prabhu

Information about the author N. Prabhu will soon be added to the site.
Found 4 papers in total
Complexity of the gravitational method for linear programming
Complexity of the gravitational method for linear programming
2001
In the gravitational method for linear programming, a particle is dropped from an...
Complexity of the AGV shortest path and single-loop guide path layout problems
Complexity of the AGV shortest path and single-loop guide path layout problems
1997
The guide path layout is one of the most important variables in the design of...
A necessary condition for polynomial-time simplex algorithms
A necessary condition for polynomial-time simplex algorithms
1995
By constructing the quasidual of a system of linear inequalities, the authors show...
Feasible gradients in Gravitational Method for Linear Programming
Feasible gradients in Gravitational Method for Linear Programming
1995
The Gravitational Method for Linear Programming (LP) promises to be a serious...
Papers per page: