论文列表及评分结果

Convergence qualification of adaptive partition algorithms in global optimization.

电商所评分:10

点击查看评分详情!

On affine scaling and semi-infinite programming.

电商所评分:2

点击查看评分详情!

Optimum matching forests I: Special weights.

电商所评分:7

点击查看评分详情!

Optimum matching forests II: General weights.

电商所评分:10

点击查看评分详情!

Optimum matching forests III: Facets of matching forest polyhedra.

电商所评分:6

点击查看评分详情!

Rank of maximum matchings in a graph.

电商所评分:10

点击查看评分详情!

On the use of penumbras in blocking and antiblocking theory.

电商所评分:3

点击查看评分详情!

On optimality conditions for structured families of nonlinear programming problems.

电商所评分:3

点击查看评分详情!

On the non-polynomiality of the relaxation method for systems of linear inequalities.

电商所评分:4

点击查看评分详情!

Axiomatic approach to statistical models and their use in multimodal optimization theory.

电商所评分:3

点击查看评分详情!

Boolean sublattices connected with minimization problems on matroids.

电商所评分:10

点击查看评分详情!

On the structure of all minimum cuts in a network and applications.

电商所评分:1

点击查看评分详情!

XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany.

电商所评分:3

点击查看评分详情!

A stochastic method for global optimization.

电商所评分:4

点击查看评分详情!

Finite checkability for integer rounding properties in combinatorial programming problems.

电商所评分:9

点击查看评分详情!

Heuristics for the fixed cost median problem.

电商所评分:4

点击查看评分详情!

On the computational utility of posynomial geometric programming solution methods.

电商所评分:2

点击查看评分详情!

A method of centers algorithm for certain minimax problems.

电商所评分:8

点击查看评分详情!

On minimax optimization problems.

电商所评分:4

点击查看评分详情!

A polynomial algorithm for integer programming covering problems satisfying the integer round-up property.

电商所评分:3

点击查看评分详情!

Convergence of a cyclic ellipsoid algorithm for systems of linear equalities.

电商所评分:4

点击查看评分详情!

Evaluating computational efficiency: A stochastic approach.

电商所评分:2

点击查看评分详情!

Partial pivoting strategies for symmetric gaussian elimination.

电商所评分:5

点击查看评分详情!

Polynomially bounded algorithms for locating p-centers on a tree.

电商所评分:1

点击查看评分详情!

Decomposition algorithms for locating minimal cuts in a network.

电商所评分:7

点击查看评分详情!

Mixed-integer quadratic programming.

电商所评分:1

点击查看评分详情!

An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs.

电商所评分:6

点击查看评分详情!

Minimum principle sufficiency.

电商所评分:7

点击查看评分详情!

Partially finite convex programming, Part I: Quasi relative interiors and duality theory.

电商所评分:6

点击查看评分详情!

Partially finite convex programming, Part II: Explicit lattice models.

电商所评分:7

点击查看评分详情!