论文列表及评分结果

Computational results of an interior point algorithm for large scale linear programming.

电商所评分:9

点击查看评分详情!

An O(n3L) adaptive path following algorithm for a linear complementarity problem.

电商所评分:1

点击查看评分详情!

An interior point algorithm to solve computationally difficult set covering problems.

电商所评分:6

点击查看评分详情!

Modifications and implementation of the ellipsoid algorithm for linear programming.

电商所评分:9

点击查看评分详情!

A discrete Newton algorithm for minimizing a function of many variables.

电商所评分:3

点击查看评分详情!

An implementation of the simplex method for linear programming problems with variable upper bounds.

电商所评分:10

点击查看评分详情!

Some facets of the simple plant location polytope.

电商所评分:10

点击查看评分详情!

A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function.

电商所评分:8

点击查看评分详情!

On accelerating PL continuation algorithms by predictor - corrector methods.

电商所评分:1

点击查看评分详情!

Existence and characterization of efficient decisions with respect to cones.

电商所评分:8

点击查看评分详情!

Polyhedral polarity defined by a general bilinear inequality.

电商所评分:9

点击查看评分详情!

Optimal scaling of balls and polyhedra.

电商所评分:2

点击查看评分详情!

Combining a path method and parametric linear programming for the computation of competitive equilibria.

电商所评分:10

点击查看评分详情!

Worst case analysis of a class of set covering heuristics.

电商所评分:2

点击查看评分详情!

Some perturbation results for the Linear Complementarity Problem.

电商所评分:1

点击查看评分详情!

Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons.

电商所评分:10

点击查看评分详情!

A critical index algorithm for nearest point problems on simplicial cones.

电商所评分:5

点击查看评分详情!

A bundle type approach to the unconstrained minimization of convex nonsmooth functions.

电商所评分:4

点击查看评分详情!

On random quadratic bottleneck assignment problems.

电商所评分:6

点击查看评分详情!

The value function of an integer program.

电商所评分:6

点击查看评分详情!

Solving staircase linear programs by the simplex method, 1: Inversion.

电商所评分:10

点击查看评分详情!

Dynamically restricted pricing in the simplex method for linear programming.

电商所评分:5

点击查看评分详情!

Conjugate direction methods with variable storage.

电商所评分:2

点击查看评分详情!

Optimal sharing.

电商所评分:6

点击查看评分详情!

A note on a sufficient-decrease criterion for a non-derivative step-length procedure.

电商所评分:1

点击查看评分详情!

An extension of the edge covering problem.

电商所评分:8

点击查看评分详情!

The journal.

电商所评分:7

点击查看评分详情!

The traveling-salesman problem and minimum spanning trees: Part II.

电商所评分:10

点击查看评分详情!

Recent advances in unconstrained optimization.

电商所评分:9

点击查看评分详情!

Some recent results in n-person game theory.

电商所评分:6

点击查看评分详情!