Encontrados 5 documentos, a visualizar página 1 de 1
Open-source software in operations research in engineering teaching
Caseiro, Palmira; Santos, Jorge M. A.; Cavique, Luís; Mendes, Armando B.ENEGI 2013: Atas do 2º Encontro Nacional de Engenharia e Gestão Industrial, Universidade de Aveiro, 17 e 18 de maio de 2013, Aveiro, Portugal. ; This contribution will focus on Computational Tools of Open-Source Software that are rather interesting in teaching Operations Research applied to engineering sciences, (Tavares et al 1996) specifically some educational experiences in the area of Forecasting; Simulati...
Multiplier adjustment in data envelopment analysis
Santos, Jorge M. A.; Cavique, Luís; Mendes, Armando B.V Congreso de Eficiencia y Productividad EFIUCO, Córdoba, 19-20 Mayo 2011. ; Weights restriction is a well-known technique in the DEA field. When those techniques are applied, weights cluster around its new limits, making its evaluation dependent of its levels. This paper introduces a new approach to weights adjustment by Goal Programming techniques, avoiding the imposition of hard restrictions that can even l...
Open-Source software in OR education
Santos, Jorge M. A.; Cavique, Luís; Mendes, Armando B.24th European Conference on Operational Research (EURO XXIV). Lisboa, 11 a 14 de Julho de 2010 (Comunicação). ; This contribution will focus on Computational Tools of Open-Source Software in OR Education. Some educational experiences in the area of Forecasting; Simulation; Graphs and Networks; Decision Theory and Linear Programming based on: R 2.10.0, Scilab 5.1.1 and an Open Source Spreadsheet will be illustr...
Um algoritmo para encontrar a cobertura por k-cliques em redes sociais
Mendes, Armando B.; Cavique, Luís; Santos, Jorge M. A.14º Congresso da APDIO, 7 a 9 de Setembro de 2009, Faculdade de Ciências e Tecnologia - Caparica. ; Na análise de redes sociais, uma k-clique é a relaxação de uma clique, i.e., uma k-clique é um quase sub-grafo completo. Um k-clique num grafo é um sub-grafo onde a distancia entre quaisquer par de vértices não é maior que k. A visualização de um pequeno número de vértices é fácil de obter. Contudo, quando o núm...
An Algorithm to Discover the k-Clique Cover in Networks.
Cavique, Luís; Mendes, Armando B.; Santos, Jorge M. A.14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009. ; In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between any two vertices is no greater than k. The visualization of a small number of vertices can be easily performed in a graph. However, whe...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||