A new concept of separation
A new efficient and flexible algorithm for the design of testable subsystems
In complex industrial plants, there are usually many sensors and the modeling of plants leads to lots of mathematical relations. This paper presents a general method for finding all the possible testable subsystems, i.e., sets of relations that can lead to various types of detection tests. This method, which is based on structural analysis, provides the constraints that have to be used for the design of each detection test and manages situations where constraints contain non-deductible variables...
A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
A new evolutionary algorithm for multiobjective optimization based on endocrine paradigm.
A new evolutionary algorithm for the multiobjective knapasck problem.
A new evolutionary optimization technique.
A New Exterior Point Algorithm for Linear Programming Problems
A new formulation and solution of the sequencing problem: algorithm
A new formulation and solution of the sequencing problem: mathematical model
A new formulation for scheduling unrelated processor under precedence constraints
A new formulation for scheduling unrelated processor under precedence constraints
We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.
A New Genetic Representation for Quadratic Assignment Problem
A new global optimization algorithm for solving generalized geometric programming.
A new heuristic for the quadratic assignment problem.
A new heuristic for the traveling salesman problem
A new method for nonsmooth convex optimization.
A new method for solving monotone generalized variational inequalities.
A new minimal point theorem in product spaces.
A new modeling and solution approach for the number partitioning problem.
A new non-interior continuation method for -NCP based on a SSPM-function
In this paper, we consider a new non-interior continuation method for the solution of nonlinear complementarity problem with -function (-NCP). The proposed algorithm is based on a smoothing symmetric perturbed minimum function (SSPM-function), and one only needs to solve one system of linear equations and to perform only one Armijo-type line search at each iteration. The method is proved to possess global and local convergence under weaker conditions. Preliminary numerical results indicate that...