N. L. Boland
: A dual-active-set algorithm for positive semi-definite quadratic programming.
: Fast deterministic approximation for the multicommodity flow problem.
: Complexity analysis of the analytic center cutting plane method that uses multiple cuts.
James B. Orlin
: A polynomial time primal network simplex algorithm for minimum cost flows.
Robert Endre Tarjan
: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm.
: Pseudomonotone variational inequality problems: Existence of solutions.
: Equivalence of variational inequality problems to unconstrained minimization.