论文列表及评分结果
On the cost of approximating all roots of a complex polynomial.
电商所评分：2
A projected lagrangian algorithm for semi-infinite programming.
电商所评分：4
Ratios of affine functions.
电商所评分：3
On market prices in linear production games.
电商所评分：4
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs.
电商所评分：9
A technique for speeding up the solution of the Lagrangean dual.
电商所评分：5
Efficient enumeration of the vertices of polyhedra associated with network LP's.
电商所评分：4
Inexact subgradient methods with applications in stochastic programming.
电商所评分：5
A deep cut ellipsoid algorithm for convex programming: Theory and applications.
电商所评分：5
A Farkas lemma for difference sublinear systems and quasidifferentiable programming.
电商所评分：8
Representations of quasi-Newton matrices and their use in limited memory methods.
电商所评分：6
The Steiner tree polytope and related polyhedra.
电商所评分：6
Tree polytope on 2-trees.
电商所评分：9
Global minimization by reducing the duality gap.
电商所评分：7
Examples of max-flow and min-cut problems with duality gaps in continuous networks.
电商所评分：8
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point.
电商所评分：7
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
电商所评分：10
The rectilinear class Steiner tree problem for intervals on two parallel lines.
电商所评分：10
The pin redistribution problem in multi-chip modules.
电商所评分：10
A strategy for array management in local memory.
电商所评分：9
Optimal mapping in direct mapped cache environments.
电商所评分：7
On the use of directions of negative curvature in a modified newton method.
电商所评分：4
A construction method in parametric programming.
电商所评分：9
A PL homotopy for finding all the roots of a polynomial.
电商所评分：1
A quadratic programming algorithm using conjugate search directions.
电商所评分：10
A computational study of active set strategies in nonlinear programming with linear constraints.
电商所评分：7
First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems.
电商所评分：5
On a class of least-element complementarity problems.
电商所评分：2
Cycling in linear complementarity problems.
电商所评分：4
Call for papers: Symposium on Mathematical Programming with Data Perturbations - May 24-25, 1979 at The George Washington University, Washington, DC, U.S.A.
电商所评分：6