论文列表及评分结果
A cutting plane algorithm for solving bilinear programs.
电商所评分：9
Win probabilities and simple majorities in probabilistic voting situations.
电商所评分：4
Some convergence properties of the conjugate gradient method.
电商所评分：2
A numerically stable optimization method based on A homogeneous function.
电商所评分：6
Feasible directions algorithms for optimization problems with equality and inequality constraints.
电商所评分：6
On A characterization of optimality in convex programming.
电商所评分：2
A condensation method for generalized geometric programming.
电商所评分：1
A note on polyhedral sets having A least element.
电商所评分：10
The assignment polytope.
电商所评分：6
Nominations for Treasurer and Council.
电商所评分：7
A network simplex method.
电商所评分：9
Maximization of A convex quadratic function under linear constraints.
电商所评分：2
Finding the nearest point in A polytope.
电商所评分：4
Shortest path algorithms for knapsack type problems.
电商所评分：4
Further facet generating procedures for vertex packing polytopes.
电商所评分：8
Transversal matroid intersections and related packings.
电商所评分：7
A dual decomposition algorithm.
电商所评分：10
Approximate cutting planes in nonlinear programming.
电商所评分：8
Mathematics in economics: Achievements, difficulties, perspectives - Nobel Memorial Lecture - 11 December 1975.
电商所评分：9
Concepts of optimality and their uses - Nobel Memorial Lecture - 11 December 1975.
电商所评分：1
A dual algorithm for the one-machine scheduling problem.
电商所评分：6
An existence theorem for solutions to f(x) = 0.
电商所评分：6
Superlinearly convergent variable metric algorithms for general nonlinear programming problems.
电商所评分：1
Fractional programming without differentiability.
电商所评分：9
Bottleneck linear programming.
电商所评分：9
Another note on bimatrix games.
电商所评分：10
A relaxation method for reconstructing objects from noisy X-rays.
电商所评分：1
An efficient algorithm for minimumk-covers in weighted graphs.
电商所评分：5
Break minimization.
电商所评分：2
Analysis of mathematical programming problems prior to applying the simplex algorithm.
电商所评分：4