论文列表及评分结果
Capacitated, balanced, sequential location-allocation problems on chains and trees.
电商所评分：2
On the solution of concave knapsack problems.
电商所评分：3
Guidelines for reporting results of computational experiments. Report of the ad hoc committee.
电商所评分：6
Linearization of mixed-integer products.
电商所评分：3
An algorithm for the 0/1 Knapsack problem.
电商所评分：5
Implicit representation of generalized variable upper bounds in linear programming.
电商所评分：7
A hybrid approach to discrete mathematical programming.
电商所评分：10
Large-scale linearly constrained optimization.
电商所评分：9
On optimality conditions in nondifferentiable programming.
电商所评分：4
Nonlinear programming methods in the presence of noise.
电商所评分：2
A quadratic network optimization model for equilibrium single commodity trade flows.
电商所评分：9
Various definitions of the derivative in mathematical programming - an addendum.
电商所评分：10
Bimatrix games - an addendum.
电商所评分：9
Tight bounds for christofides' traveling salesman heuristic.
电商所评分：5
A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set.
电商所评分：10
Power, prices, and incomes in voting systems.
电商所评分：4
Matrix conditioning and nonlinear optimization.
电商所评分：7
A class of methods for linear programming.
电商所评分：3
Second order characterizations of pseudoconvex functions.
电商所评分：5
The computation of a general equilibrium in a public goods economy.
电商所评分：6
Linearly constrained minimax optimization.
电商所评分：4
Algorithms for nonlinear constraints that use lagrangian functions.
电商所评分：2
Finding all efficient extreme points for multiple objective linear programs.
电商所评分：7
An analysis of approximations for maximizing submodular set functions - I.
电商所评分：10
On the Fermat - Weber problem with convex cost functions.
电商所评分：7
The adjacency relation on the traveling salesman polytope is NP-Complete.
电商所评分：5
The reformulation of two mixed integer programming problems.
电商所评分：4
Algorithms for non-convex Sn-games.
电商所评分：3
Numerically stable methods for quadratic programming.
电商所评分：2
A property of continuous unbounded algorithms.
电商所评分：3