论文列表及评分结果
Parametric linear programming and anti-cycling pivoting rules.
电商所评分：9
The upper and lower second order directional derivatives of a sup-type function.
电商所评分：9
Inclusion functions and global optimization II.
电商所评分：9
Stationary dual prices and depreciation.
电商所评分：7
Linear programming and the newton barrier flow.
电商所评分：6
An extension of the könig-egerváry property to node-weighted bidirected graphs.
电商所评分：9
On the solution of highly degenerate linear programmes.
电商所评分：8
Letter to the editor.
电商所评分：1
Mathematical programming study 31 - Computational Mathematical Programming.
电商所评分：9
Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
电商所评分：2
Cutting-Plane Proofs in Polynomial Space.
电商所评分：2
An Efficient Algorithm for the Minimum Capacity Cut Problem.
电商所评分：5
On the Convergence Properties of Hildreth's Quadratic Programming Algorithm.
电商所评分：10
On a Subproblem of Trust Region Algorithms for Constrained Optimization.
电商所评分：1
On Pareto Optima, the Fermat-Weber Problem, and Polyhedral Gauges.
电商所评分：7
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.
电商所评分：2
On Differential Stability in Stochastic Programming.
电商所评分：8
A Bifurcation Analysis of the Nonlinear Parametric Programming Problem.
电商所评分：2
A Note on the Continuity of Solutions of Parametric Linear Programs.
电商所评分：5
Chvátal Closures for mixed Integer Programming Problems.
电商所评分：1
An Algorithm for Linear Programming which Requires O(((m+n)n2 + (m+n)1.5n)L) Arithmetic Operations.
电商所评分：8
Approximate Subdifferential and Metric Regularity: The Finite-Dimensional Case.
电商所评分：6
Facet Identification for the Symmetric Traveling Salesman Polytope.
电商所评分：7
Some Proximity and Sensitivity Results in Quadratic Integer Programming.
电商所评分：8
On the Convergence of Cross Decomposition.
电商所评分：5
A New Theorem of the Alternative.
电商所评分：3
Convergence Properties of Trust Region Methods for Linear and Convex Constraints.
电商所评分：7
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm.
电商所评分：8
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time.
电商所评分：9
Facets of the Clique Partitioning Polytope.
电商所评分：1