Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Rafael López Bracho"'
Publikováno v:
Programación Matemática y Software, Vol 10, Iss 1 (2018)
A classical problem in graph theory and combinatorial optimization is the known as Graph Coloring Problem (GC). This problem consists in assigning colors to vertices of a graph such that two adjacent vertices must have different colors. The objective
Externí odkaz:
https://doaj.org/article/e643b634e4cd4955992fbae0e44e2f45
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 22, Iss 2, Pp 325-339 (2015)
In the problem of scheduling of courses, it is generally assumed that the allocation of subjects to teaching periods is an input of the problem, which is defined by the academic authorities. This paper presents a methodology that makes use of linear
Externí odkaz:
https://doaj.org/article/69b8d51b6ab5483dbf5ac48833b96ea8
Autor:
Pedro Lara Velázquez, Miguel Ángel Gutiérrez Andrade, Javier Ramírez Rodríguez, Rafael López Bracho
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 12, Iss 1-2, Pp 111-120 (2012)
Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join vertices whose endpoint are equa
Externí odkaz:
https://doaj.org/article/0a37d3e309a8481aa7c066017f8b5fed
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 16, Iss 2, Pp 255-266 (2010)
This paper proposes a Markov observation based model, where the transition ma- trix is formulated using air quality monitoring data for specific pollutant emissions, with the primary objective to analyze the corresponding stationary distributions and
Externí odkaz:
https://doaj.org/article/7f36e63bd9f148f6a5ebf920bd598ca9
Autor:
Rafael López Bracho, Miguel Ángel Gutiérrez Andrade, María Paula Ortuño Sánchez, Javier Ramírez Rodríguez
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 10, Iss 1-2, Pp 156-167 (2009)
Registration process at the Universidad Aut´onoma Metropolitana is such that every student is free to choose his/her own subjects and schedule. Success of this system, based in the percentage of students that obtain a place in the lectures chosen, d
Externí odkaz:
https://doaj.org/article/e5c8f666101541cd81202fa75351dcfb
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 7, Iss 1-2, Pp 125-134 (2009)
Un conjunto S de vértices de una gráfica G es independiente si no existen dos vértices de S que sean adyacentes, esto es, la subgráfica de G inducida por S no tiene aristas. En este trabajo presentaremos un algoritmo paralelo que permite la obten
Externí odkaz:
https://doaj.org/article/e2443442bac2454abf94ae062ade48bb
Publikováno v:
Revista de Matemática: Teoría y Aplicaciones, Vol 19, Iss 2 (2012)
Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro. Si
Externí odkaz:
https://doaj.org/article/8f4e2482b1d94edaa0661fc6371b34a2
Publikováno v:
Case Studies on Transport Policy. 9:1059-1072
Bike-sharing systems (BSS) are a healthy and environmentally friendly alternative for public transportation in many large urban areas around the world. In 2010, Mexico City started its BSS, named Ecobici, with 84 stations and reached more than 840,00
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b802aa1ff2f2147847101d6eed1a1495
https://doi.org/10.1016/j.cstp.2021.01.014
https://doi.org/10.1016/j.cstp.2021.01.014
Publikováno v:
Journal of Statistical Computation and Simulation. 90:3250-3259
In this paper, we derive analytical expressions of the expected value of the arrival epochs given a bounded period of observation for the homogeneous Poisson process (HPP) and for the general case ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d0f6941bb9ef2c9c533595683a1bd4b
https://doi.org/10.1080/00949655.2020.1800707
https://doi.org/10.1080/00949655.2020.1800707
Publikováno v:
Programación Matemática y Software. 10
Un problema clásico en la teoría de gráficas es el conocido como problema de coloración (GC por sus siglas en inglés). Este problema consiste en asignar colores a los vértices de la gráfica tal que vértices adyacentes deben tener colores dife
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87654da804f38623c7495543032f4c9c
https://doi.org/10.30973/progmat/2018.10.1/3
https://doi.org/10.30973/progmat/2018.10.1/3