Problemi di ottimizzazione nella teoria delle code
Previous Page 3
Displaying 41 – 57 of 57
Programming with parametric elements of the matrix coefficients
Ramon M. Arana (1977)
RAIRO - Operations Research - Recherche Opérationnelle
Prolongement des jeux à deux joueurs de somme nulle. Une théorie abstraite des duels
Herve Moulin (1976)
Mémoires de la Société Mathématique de France
Rectifiabilité quantifié et le problème du voyageur de commerce
G. David (1990/1991)
Séminaire Équations aux dérivées partielles (Polytechnique)
Reformulations in Mathematical Programming: Definitions and Systematics
Leo Liberti (2009)
RAIRO - Operations Research
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts to move...
Strong convergence theorems for countable Lipschitzian mappings and its applications in equilibrium and optimization problems.
Yang, Liping, Su, Yongfu (2009)
Fixed Point Theory and Applications [electronic only]
Sufficient decrease principle on Riemannian manifolds.
Udrişte, Constantin (1996)
Balkan Journal of Geometry and its Applications (BJGA)
The Algebraic Degree of Geometric Optimization Problems.
C. Bajaj (1988)
Discrete & computational geometry
The gradient method for non-differentiable operators in product Hilbert spaces and applications to elliptic systems of quasilinear differential equations.
Karátson, J. (1997)
Journal of Applied Analysis
Un problema de búsqueda de una recta.
Noemí Zoroa Alonso (1988)
Trabajos de Investigación Operativa
En este trabajo se estudia el problema de la búsqueda de una recta de entre n tangentes a una circunferencia. Se da un método para calcular la longitud media óptima del camino recorrido hasta encontrar la recta. Se obtienen ecuaciones que determinan la trayectoria solución de este problema.
Une heuristique pour le problème de l'arbre de Steiner
Choukhmane El-Arbi (1978)
RAIRO - Operations Research - Recherche Opérationnelle
К вопросу о выборе направлений спуска в задачах безусловной минимизации функций
И.Я. Заботин (1989)
Issledovanija po prikladnoj matematike
Метод вентров с адаптацией параметров на основе наискорейшего спуска
Е.А. Князев (1988)
Issledovanija po prikladnoj matematike
Метод нахождения минимакса при наличии ограничений
Р.Н. Саттаров (1988)
Issledovanija po prikladnoj matematike
Необходимые условия в задачах математического программирования и дискретной оптимизации
В.Г. Болтянский (1972)
Matematiceskie issledovanija
Об одном методе отыскания минимакса
А.И. Кораблев (1988)
Issledovanija po prikladnoj matematike
Уточнение оценок скорости сходимости метода случайного поиска
А.Ф. Годонога (1986)
Matematiceskie issledovanija
Currently displaying 41 – 57 of 57
Previous Page 3