论文列表及评分结果
Convex composite multi-objective nonsmooth programming.
电商所评分：10
An active-set strategy in an interior point method for linear programming.
电商所评分：5
A little theorem of the big Mu in interior point algorithms.
电商所评分：3
Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
电商所评分：1
Remarks on the generalized Newton method.
电商所评分：3
A note on the prize collecting traveling salesman problem.
电商所评分：5
Symmetric indefinite systems for interior point methods.
电商所评分：2
Exploiting special structure in a primal-dual path-following algorithm.
电商所评分：7
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope.
电商所评分：9
Hamiltonian path and symmetric travelling salesman polytopes.
电商所评分：1
Solution of linear least squares via the ABS algorithm.
电商所评分：10
A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints.
电商所评分：4
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results.
电商所评分：10
The basic theorem of complementarity revisited.
电商所评分：9
A deterministic algorithm for global optimization.
电商所评分：5
Parallel decomposition of multistage stochastic programming problems.
电商所评分：6
Dual bin packing with items of random sizes.
电商所评分：4
Near boundary behavior of primal-dual potential reduction algorithms for linear programming.
电商所评分：4
On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions.
电商所评分：6
Structure of a simple scheduling polyhedron.
电商所评分：6
Towards equitable distribution via proportional equity constraints.
电商所评分：1
A lift-and-project cutting plane algorithm for mixed 0-1 programs.
电商所评分：6
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets.
电商所评分：8
A nonsmooth version of Newton's method.
电商所评分：9
A globally convergent Newton method for solving strongly monotone variational inequalities.
电商所评分：4
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem.
电商所评分：1
D.c. sets, d.c. functions and nonlinear equations.
电商所评分：3
The journal.
电商所评分：1
A step toward probabilistic analysis of simplex method convergence.
电商所评分：5
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts.
电商所评分：1