[PDF] Top 20 Pesqui. Oper. vol.29 número1

... Genetic algorithms (GAs – Goldberg, 1989; Michalewicz, 1996) are probabilistic optimization techniques based on the natural evolution process that have been used to tackle a variety of [r] ... See full document

... After the construction of the release rules, they were applied to operate the reservoir under 10 new 19-year monthly inflow ensembles (named Sim#1, Sim#2 up to Sim#10) and the results [r] ... See full document

... Therefore, with these two additional objective functions, the multiobjective programming problem called Multiple Criteria Data Envelopment Analysis – MCDEA is formulated as in (2), in [r] ... See full document

... Cabe destacar que la aplicación de esta metodología tiene las siguientes ventajas: organiza la tarea del equipo dado que provee una modalidad estructurada de trabajo; estimula el proces[r] ... See full document

... For each instance, we first solved the linear relaxation of the original problem, and applied the rounding heuristic described in 5.3 We then attempted to solve the problem using a Bra[r] ... See full document

... Empirical modeling is considered from the perspectives of a general scheme for the Strategy of Empirical Research and Optimization Process (SEROP). This approach intends to facilitate t[r] ... See full document

... Algumas características não cobertas são: a possibilidade de comunicação assíncrona, quando um cálculo acessa elementos de uma estrutura de dados compartilhados em um modo não estrutur[r] ... See full document

... O presente número da revista Pesquisa Operacional é uma edição especial sobre Otimização Combinatória e suas Aplicações, em homenagem ao Professor Maculan e, em 2004, teremos uma ediçã[r] ... See full document

... In fact, one can say that basically in almost every Brazilian University where there is any activity in combinatorial optimization or operations research, there is some faculty member [r] ... See full document

... The present paper corrects a small point in the proof of the convergence given by Alizadeh (1995) and gives the value of the derivative of the potential function at 0 needed to perfor[r] ... See full document

... In particular, we give several classes of facet defining inequalities of this polytope and we prove that the separation problem associated to one of these classes of inequalities is NP[r] ... See full document

... In Section 4, numerical results are used to evaluate the efficiency of other strategies, by keeping a small percentage of best performing chromosomes from generation to generation and [r] ... See full document

... No que diz respeito ao desenvolvimento do sistema, o AIMMS fornece recursos para a modelagem de problemas, para a manipulação de dados, para a criação de cenários e para a resolução de[r] ... See full document

... We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary p[r] ... See full document

... The main objective of this paper is to show how the amount of characteristics missing in the observed sample could be easily estimated by using some Bayesian estimators proposed by Min[r] ... See full document

... Este editor precisa destacar e agradecer a iniciativa e a valiosa colaboração que teve dos Professores Cláudio Thomas Bornstein e Nair Maria Maia de Abreu, ambos da Universidade Federa[r] ... See full document

... Certamente estes fatos contribuíram para a fundação da Associação Latino-Ibero-Americana de Pesquisa Operacional, ALIO, em 1982, do qual Galvão foi o presidente no primeiro biênio, alé[r] ... See full document

... In the formulation above the objective function seeks to maximize the total population covered. Constraints (28) state that a demand area j ∈J is covered if there is at least one facility within distance SD from it. ... See full document

... The computational results mainly compare the algorithm proposed in the previous section with the algorithms presented by Bornstein & Azlan (1998), Van Roy (1986) and Beasley (1993)[r] ... See full document

... The basic idea of a (forward) Web proxy cache is that a request for an object is sent from the client to a specified ‘nearby’ cache, where there is a check to see whether the cache h[r] ... See full document