论文列表及评分结果
Broyden's method in Hilbert space.
电商所评分：4
A simple constraint qualification in infinite dimensional programming.
电商所评分：1
The method of successive affine reduction for nonlinear minimization.
电商所评分：6
Some comments on Wolfe's 'away step'.
电商所评分：5
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
电商所评分：7
On the complexity of solving feasible systems of linear inequalities specified with approximate data.
电商所评分：9
The extended linear complementarity problem.
电商所评分：3
A unifying geometric solution framework and complexity analysis for variational inequalities.
电商所评分：10
Applying Lehman's theorems to packing problems.
电商所评分：10
A note on locally Lipschitzian functions.
电商所评分：7
Ideal polytopes and face structures of some combinatorial optimization problems.
电商所评分：6
A descent method with linear programming subproblems for nondifferentiable convex optimization.
电商所评分：9
One-third-integrality in the max-cut problem.
电商所评分：7
Smoothing methods for convex inequalities and linear complementarity problems.
电商所评分：9
The Fermat-Weber location problem revisited.
电商所评分：1
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities.
电商所评分：9
On minquantile and maxcovering optimisation.
电商所评分：10
Finite horizon approximations of infinite horizon linear programs.
电商所评分：4
Using shortest paths in some transshipment problems with concave costs.
电商所评分：10
Experiments in mixed-integer linear programming using pseudo-costs.
电商所评分：6
Isotone solutions of parametric linear complementarity problems.
电商所评分：1
On monotonicity in parametric linear complementarity problems.
电商所评分：6
The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals.
电商所评分：5
An algorithm for determining all extreme points of a convex polytope.
电商所评分：8
On the integer-valued variables in the linear vertex packing problem.
电商所评分：4
Compact LP bases for a class of IP problems.
电商所评分：6
On the existence and uniqueness of solutions in nonlinear complementarity theory.
电商所评分：6
A monotone complementarity problem with feasible solutions but no complementary solutions.
电商所评分：1
A note on the necessary conditions for exact aggregation of linear programming models.
电商所评分：8
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming.
电商所评分：5