Found 97029 papers in total
1990,
This paper examines experimentally the nature of people’s risk-attitudes across different payoff...
1989,
Homotopy methods are known to be globally convergent algorithms for solving systems of nonlinear equations...
1990,
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the sum of the (weighted)...
1990,
The notion of graphical metric regularity is introduced and conditions ensuring this kind of regularity...
1990,
PROPS is a set of models which solves a broad range of probabilistic operations research problems. It is a...
1990,
Subdivisions are continuously deformed subject to three local conditions and shown to retain the global...
1990,
The limit distributions of multivariate extreme values of stationary random sequences are associated under...
1990,
Proximal bundle methods for minimizing a convex function f generate a sequence { x k } by taking x k...
1990,
A class of methods for solving a large system of convex inequalities is given. All of the methods in the...
1990,
A classical method for solving the variational inequality problem is the projection algorithm. We show...
1990,
The familiar Fenchel-Moreau-Rockafellar duality scheme deduced from conjugation is shown to be applicable...
1990,
The concept of a super value node is developed to extend the theory of influence diagrams to allow dynamic...
1990,
Defining the mapping F from the 2 n- dimensional Euclidean space into itself by for every , the authors...
1990,
Three classes of valid inequalities based upon multiple knapsack constraints are derived for the...
1990,
A class of facet defining inequalities for the generalized assignment problem is derived. These...
1990,
The bicriteria problem is an important problem in multiobjective optimization that has been studied...
1990,
The authors consider the following scheduling problem. There are m parallel machines and n independent...
1990,
Several algorithms already exist for solving the uncapacitated facility location problem. The most...
1990,
Let the arc-lengths L ij of a complete digraph on n vertices be independent uniform [0,1] random...
1990,
Following Chvátal, cutting planes may be viewed as a proof system for establishing that a given...
1990,
Chvátal introduced the idea of viewing cutting planes as a system for proving that every integral...
1990,
Several procedures for the identification of facet inducing inequalities for the symmetric traveling...
1990,
The authors show that for any optimal solution nz for a given separable quadratic integer programming...
1990,
Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously...
Papers per page: