论文列表及评分结果
A new strongly polynomial dual network simplex algorithm.
电商所评分：4
A new pivot selection rule for the network simplex algorithm.
电商所评分：8
On strongly polynomial dual simplex algorithms for the maximum flow problem.
电商所评分：4
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm.
电商所评分：7
How to compute least infeasible flows.
电商所评分：3
Flows on hypergraphs.
电商所评分：4
Multiflows and disjoint paths of minimum total cost.
电商所评分：10
A branch-and-cut algorithm for the equicut problem.
电商所评分：5
The Steiner tree packing problem in VLSI design.
电商所评分：8
Minimum-perimeter domain assignment.
电商所评分：4
Potential-reduction methods in mathematical programming.
电商所评分：6
Long-step strategies in interior-point primal-dual methods.
电商所评分：8
Fast convergence of the simplified largest step path following algorithm.
电商所评分：9
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
电商所评分：1
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.
电商所评分：6
An infeasible interior-point algorithm for solving primal and dual geometric programs.
电商所评分：9
A QMR-based interior-point algorithm for solving linear programs.
电商所评分：7
On homogeneous and self-dual algorithms for LCP.
电商所评分：8
Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points.
电商所评分：5
Volumetric path following algorithms for linear programming.
电商所评分：4
Constraint aggregation principle in convex optimization.
电商所评分：4
Separating plane algorithms for convex optimization.
电商所评分：8
Variable metric bundle methods: From conceptual to implementable forms.
电商所评分：7
A preconditioning proximal Newton method for nondifferentiable convex optimization.
电商所评分：10
A trust region method for minimization of nonsmooth functions with linear constraints.
电商所评分：7
On piecewise quadratic Newton and trust region problems.
电商所评分：5
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems.
电商所评分：3
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems.
电商所评分：10
Solution of monotone complementarity problems with locally Lipschitzian functions.
电商所评分：9
QPCOMP: A quadratic programming based solver for mixed complementarity problems.
电商所评分：7