Artículos de Revista
Examinar
Examinando Artículos de Revista por Materia "12 Matemáticas"
Mostrando 1 - 5 de 5
- Resultados por página
- Opciones de ordenación
Ítem BFC, A Branch-and-Fix Coordination Algorithmic Framework for solving Some Types of Stochastic Pure and Mixed 0-1 Programs(Elsevier, 2003) Alonso-Ayuso, Antonio; Escudero, Laureano F; Ortuño, M TeresaWe present a framework for solving some types of $0-1$ multi-stage scheduling/planning problems under uncertainty in the objective function coefficients and the right-hand-side. A scenario analysis scheme with full recourse is used. The solution offered for each scenario group at each stage takes into account all scenarios but without subordinating to any of them. The constraints are modelled by a splitting variables representation via scenarios. So, a $0-1$ model for each scenario is considered plus the non-anticipativity constraints that equate the $0-1$ variables from the same group of scenarios in each stage. The mathematical representation of the model is very amenable for the proposed framework to deal with the $0-1$ character of the variables. A Branch-and-Fix Coordination approach is introduced for coordinating the selection of the branching nodes and branching variables in the scenario subproblems to be jointly optimized. Some computational experience is reported for different types of problems.Ítem Interest Point Detection in Images by a Local Centrality Algorithm on Complex Networks(Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos, 2011-04-01) Criado, R.; Romance, M.; Sanchez, A.The field of Digital Image Processing offers an interesting framework for the application of the Complex Networks theory. Since images can be seen as organized data structures of adjacent pixels, it becomes natural to model and analyze them using complex network properties. We present a local centrality algorithm on a network with the aim detect the position and importance of interest points (i.e. corners) in a digital image. An spatial and weighted complex network is associated to the image and a new method for locating these feature points based on a local centrality measure of the corresponding network, is proposed.Ítem Line graphs for directed and undirected networks: An structural and analytical comparison(Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos, 2011-10-24) Criado, R.; Flores, J.; Garcia del Amo, A.; Romance, M.The centrality and e±ciency measures of a network G are strongly related to the respective measures on the associated line graph L(G) and bipartite graph B(G) as was shown in [8]. In this note we consider different ways to obtain a line graph from a given directed or undirected network and we obtain some interesting relations.Ítem Matrix growth models based on centrality measures: a first analysis(Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos, 2011-10-24) Pedroche, F.; Criado, R.; Garcia, E.; Romance, M.A general growth model of random networks based on centrality measures is introduced. This formalism extends the well-known models of prefer- ential attachment. We propose to set the preferential attachment using a linear function of some centrality measures ranging from local to global scale. The aim is to include spectral measures, such as PageRank and Bonacich, and geodesic measures, such as betweenness and closeness. In this paper we present a first analysis using degree and Personalized PageRank.Ítem Powers of operators dominated by strictly singular operators(The Quarterly Journal of Mathematics, 2007-12-04) Flores Álvarez, Julio; Hernández Rodríguez, Francisco Luis