Megiddo Nimrod

Nimrod Megiddo

Information about the author Nimrod Megiddo will soon be added to the site.
Found 13 papers in total
A modified layered-step interior-point algorithm for linear programming
A modified layered-step interior-point algorithm for linear programming
1998
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The...
New algorithms for generalized network flows
New algorithms for generalized network flows
1994
This paper is concerned with generalized network flow problems. In a generalized...
Linear time algorithms for some separable quadratic programming problems
Linear time algorithms for some separable quadratic programming problems
1993
A large class of separable quadratic programming problems is presented. The problems...
A primal-dual infeasible-interior-point algorithm for linear programming
A primal-dual infeasible-interior-point algorithm for linear programming
1993
As in many primal-dual interior-point algorithms, a primal-dual...
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
1993
This paper proposes two sets of rules, Rule G and Rule P, for controlling step lengths...
A general framework of continuation methods for complementarity problems
A general framework of continuation methods for complementarity problems
1993
A general class of continuation methods is presented which, in particular, solve...
An interior point potential reduction algorithm for the linear complementarity problem
An interior point potential reduction algorithm for the linear complementarity problem
1992
The linear complementarity problem can be viewed as the problem of minimizing subject...
Homotopy continuation methods for nonlinear complementarity problems
Homotopy continuation methods for nonlinear complementarity problems
1991
A complementarity problem with a continuous mapping f from R n into itself can be...
A unified approach to interior point algorithms for linear complementarity problems: A summary
A unified approach to interior point algorithms for linear complementarity problems: A summary
1991
This note summarizes a report with the same title, where a study was carried out...
Exact computation of optimal inventory policies over an unbounded horizon
Exact computation of optimal inventory policies over an unbounded horizon
1991
An inventory scheduling model with forbidden time intervals is analyzed. The objective...
Approximation algorithms for hitting objects with straight lines
Approximation algorithms for hitting objects with straight lines
1991
In the hitting set problem one is given m subsets of a finite set N and one has to...
On the ℝà-perturbation method for avoiding degeneracy
On the ℝà-perturbation method for avoiding degeneracy
1989
Although it is NP-complete to decide whether a linear programming problem is...
Boundary behavior of interior point algorithms in linear programming
Boundary behavior of interior point algorithms in linear programming
1989
This paper studies the boundary behavior of some interior point algorithms fo linear...
Papers per page: