论文列表及评分结果
Decomposition through formalization in a product space.
电商所评分：5
An extension of Tarski's fixed point theorem and its application to isotone complementarity problems.
电商所评分：10
How to deal with the unbounded in optimization: Theory and algorithms.
电商所评分：3
A modified lift-and-project procedure.
电商所评分：5
Measure concentration in optimization.
电商所评分：5
Efficiently solvable special cases of hard combinatorial optimization problems.
电商所评分：1
Two applications of the Divide&Conquer principle in the molecular sciences.
电商所评分：9
Interactions between nonlinear programming and modeling systems.
电商所评分：2
Algorithms for railway crew management.
电商所评分：2
Semidefinite programming in combinatorial optimization.
电商所评分：5
Logical analysis of numerical data.
电商所评分：8
Cluster analysis and mathematical programming.
电商所评分：4
Linear programming, the simplex algorithm and simple polytopes.
电商所评分：6
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming.
电商所评分：9
Cuts, matrix completions and graph rigidity.
电商所评分：6
Interior-point methods: An old and new approach to nonlinear programming.
电商所评分：4
Error bounds in mathematical programming.
电商所评分：10
Decomposition methods in stochastic programming.
电商所评分：7
Test sets for integer programs.
电商所评分：6
Criss-cross methods: A fresh view on pivot algorithms.
电商所评分：8
Recent progress in unconstrained nonlinear optimization without derivatives.
电商所评分：9
Discrete optimization in public rail transport.
电商所评分：3
Free material optimization via mathematical programming.
电商所评分：7
Pseudomonotone variational inequality problems: Existence of solutions.
电商所评分：4
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
电商所评分：8
Equivalence of variational inequality problems to unconstrained minimization.
电商所评分：9
Tradeoff directions in multiobjective optimization problems.
电商所评分：9
A globally convergent version of the Polak-Ribière conjugate gradient method.
电商所评分：7
A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming.
电商所评分：9
A polynomial time primal network simplex algorithm for minimum cost flows.
电商所评分：5