Alireza Mohebi Ashtiani
Alireza Mohebi Ashtiani
Dirección de correo verificada de utfpr.edu.br
Título
Citado por
Citado por
Año
Global maximization of a generalized concave multiplicative problem in the outcome space
AM Ashtiani, PAV Ferreira
Anais do CNMAC 3, 377-383, 2010
102010
A branch-and-cut algorithm for a class of sum-of-ratios problems
AM Ashtiani, PAV Ferreira
Applied Mathematics and Computation 268, 596-608, 2015
72015
On the solution of generalized multiplicative extremum problems
AM Ashtiani, PAV Ferreira
Journal of optimization theory and applications 149 (2), 411-419, 2011
32011
Global Optimization Algorithms for a Class of Fractional Programming Problems
AM Ashtiani, PAV Ferreira
XLII Simpósio Brasileiro de Pesquisa Operacional, 2010
12010
The 0–Knapsack Problem: A Continuous Generalized Convex Multiplicative Programming Approach
AM Ashtiani, PAV Ferreira, FF Lopes
2015
A Branch–and–Bound Algorithm for a Special Class of Generalized Multiplicative Programming Programs
AM Ashtiani, PAV Ferreira
XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014
2014
Otimização global determinística no espaço-imagem: problemas multiplicativos e fracionários
AM Ashtiani
UNICAMP, 2012
2012
Minimizing the Product of Two Positive Linear Functions
AM Ashtiani, A Soveini
5th International Conference of Iranian Operational Research Society, 2012
2012
A Branch and Bound Algorithm for a Class of Multiplicative Programs
AM Ashtiani, PAV Ferreira
International Conference on Operations Research and Optimization, 2012
2012
Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem
AM Ashtiani, PAV Ferreira
10th International Conference on Operations Research, Havana, Cuba, 2012
2012
Um Algoritmo Branch and Bound para uma Classe de Problemas de Programação Multiplicativa
AM Ashtiani, PAV Ferreira
XLIII Simpósio Brasileiro de Pesquisa Operacional, 2011
2011
A BRANCH–AND–CUT ALGORITHM FOR CONVEX MULTIPLICATIVE PROGRAMMING
AM Ashtiani, PAV Ferreira, AA Einstein, B Geraldo
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–12