[PDF] Top 20 Pesqui. Oper. vol.32 número3

... bled. Strong cuts usually mean fewer iterations. In order to have strong cuts, the solution of the SP has to be judiciously done, since the Benders algorithm is very sensitive to the selection of the dual variables. If ... See full document

... This article is structured in the following form: Section 2 presents a bibliographic review of computational simulation combined with optimization; Section 3 presents the proposed opti- [r] ... See full document

... It is important to notice that, although the family farmers who used the mulch technology have obtained, on average, small efficiency scores than those who cultivated with slash and burn[r] ... See full document

... Each figure displays the nominal (non-robust) Pareto front, the robust Pareto front considering the Robustness Index as the third objective function to be minimized and the Pareto front [r] ... See full document

... In order to aggregate users’ and DMs’ judgments and preferences, the philosophy of the SMARTS Swing Weights procedure was used to determine the limits of the ratios between the weights o[r] ... See full document

... The value for the active project (ANPV) increases from US$ 162.09 to US$ 410.03 with the reduction of one stop knot in the designed uncertainty tree. The PNPV for this time configuration[r] ... See full document

... (2005) used multi-criteria technique to develop a supply chain network model in which both physical and electronic transactions are allowed and in which sup- ply side risk as well as dem[r] ... See full document

... This paper presents the application of a stochastic Benders decomposition algorithm for the problem of supply chain investment planning under uncertainty applied to the petroleum byprodu[r] ... See full document

... Methods SAW and TODIM are based on eliciting the decision maker’s preferences (weights and values) directly in a quantitative form while using linear (SAW) and non-linear (TODIM) aggrega[r] ... See full document

... Alidaee & Ahmadian (1996) first presented an algorithm with complexity O( n log n ) for the problem where the speed depends only on the number of previously processed jobs, and th[r] ... See full document

... this task. (Interested readers can request a copy of the program directly from the authors.) Figure 3 shows the plots of the expected cost versus the sampling interval m for some cases chosen to illustrate the behavior ... See full document

... Notando-se que Glover utiliza o mesmo conjunto de restrições para as duas relaxações, isto implica em relaxar um subconjunto destas restrições de forma Lagrangeana e seu complemento de[r] ... See full document

... The cost differences for every new solution are determined and ordered, the first difference being added to the current value and the corresponding solution is sent to a local search r[r] ... See full document

... This implies that the non-restrictive version of our problem can be solved in polynomial time using the algorithm proposed by Bagchi, Chang & Sullivan (1987) for the problem with i[r] ... See full document

... In this class of graphs, the clique-transversal problem is equivalent to vertex cover, and vertex cover is NP-complete for triangle-free graphs [Pol74]?. Remember that in this case the[r] ... See full document

... Studies carried out on the water hyacinth pond with a superficial area of 100 m 3 in the experimental system for the treatment of piggery wastes at EMBRAPA-CNPSA, in Concórdia/SC, ind[r] ... See full document

... Pour le problème ainsi obtenu, nous proposons différents schémas de résolution par relaxation et décomposition, qui induisent la recherche d’un flot auxiliaire dont la partie entière s[r] ... See full document

... Using a filter for Missing Values and Outliers (FMO) these irregularities are corrected, transforming the minute by minute data recording into a statistically modelled time series, that[r] ... See full document

... A partir daí, diversos cenários de alocação dos alunos foram propostos, buscando reduzir esses custos de deslocamento, tendo como parâmetro um Índice Global de Acessibilidade calculado[r] ... See full document

... This work consists in the use of Rough Sets Theory, in order to pre-processing data to be presented to Self-Organizing Map neural network (Hybrid Architecture) for clusters analysis.. Ex[r] ... See full document