论文列表及评分结果
An interior point potential reduction algorithm for the linear complementarity problem.
电商所评分：7
Crashing a maximum-weight complementary basis.
电商所评分：9
A polynomial method of approximate centers for linear programming.
电商所评分：2
Finite dimensional approximation in infinite dimensional mathematical programming.
电商所评分：2
Paths on polymatroids.
电商所评分：6
A time indexed formulation of non-preemptive single machine scheduling problems.
电商所评分：1
In memory of Tjalling C. Koopmans.
电商所评分：9
A unified framework for primal-dual methods in minimum cost network flow problems.
电商所评分：1
The polynomial hierarchy and a simple model for competitive analysis.
电商所评分：6
Solving large-scale mixed-integer programs with fixed charge variables.
电商所评分：5
Metrics and undirected cuts.
电商所评分：10
Applications of the method of partial inverses to convex programming: Decomposition.
电商所评分：2
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations.
电商所评分：2
An example of irregular convergence in some constrained optimization methods that use the projected hessian.
电商所评分：4
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory.
电商所评分：3
On uniqueness of Kuhn-Tucker multipliers in nonlinear programming.
电商所评分：3
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds.
电商所评分：3
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators.
电商所评分：6
Linear programming with spheres and hemispheres of objective vectors.
电商所评分：1
A primal projective interior point method for linear programming.
电商所评分：6
An infeasible (exterior point) simplex algorithm for assignment problems.
电商所评分：6
Solving knapsack sharing problems with general tradeoff functions.
电商所评分：2
Factorized quasi-Newton methods for nonlinear least squares problems.
电商所评分：2
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems.
电商所评分：4
The relationship between integer and real solutions of constrained convex programming.
电商所评分：3
Solution of large-scale symmetric travelling salesman problems.
电商所评分：2
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function.
电商所评分：10
A class of methods for solving large, convex quadratic programs subject to box constraints.
电商所评分：5
Normal conical algorithm for concave minimization over polytopes.
电商所评分：4
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q0.
电商所评分：5