Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Javier Marenco"'
Autor:
Ivo Koch, Javier Marenco
Publikováno v:
Discrete Applied Mathematics. 323:286-301
Given a matrix with real-valued entries, the maximum 2D subarray problem consists in finding a rectangular submatrix with consecutive rows and columns maximizing the sum of its entries. In this work we start a polyhedral study of an integer programmi
Publikováno v:
Central European Journal of Operations Research.
Autor:
Ivo Koch, Javier Marenco
Publikováno v:
4OR. 21:329-358
Publikováno v:
Annals of Operations Research. 316:891-904
Publikováno v:
INFORMS Journal on Applied Analytics. 51:136-149
The first division clubs in Argentinean professional football maintain teams in each of six youth leagues, classed by age as major divisions (Under-20, Under-18, Under-17) and minor divisions (Under-16, Under-15, Under-14). Regular season play in the
Autor:
Manuela Blaum, Javier Marenco
Publikováno v:
Procedia Computer Science. 195:532-542
Autor:
Mónica Braga, Javier Marenco
Publikováno v:
RAIRO - Operations Research. 54:1863-1874
A coloring of a graph is an assignment of colors to its vertices such that any two vertices receive distinct colors whenever they are adjacent. An acyclic coloring is a coloring such that no cycle receives exactly two colors, and the acyclic chromati
Autor:
María del Carmen Varaldo, Maria E. Ugarte, Mónica Braga, Mariana S. Escalante, Javier Marenco, Diego Delle Donne
Publikováno v:
Discrete Applied Mathematics. 281:69-80
In this paper we define a generalization of the classical vertex coloring problem of a graph, where some pairs of adjacent vertices can be assigned to the same color. We call weak an edge connecting two such vertices. We look for a coloring of the gr
Autor:
Javier Marenco
Publikováno v:
RAIRO - Operations Research. 53:1267-1277
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results in a path. Given a graph G, a caterpillar-packing of G is a set of vertex-disjoint (not necessarily induced) subgraphs of G such that each subgraph is
Autor:
Mónica Braga, Javier Marenco
Publikováno v:
LAGOS
Given two graphs G = (V, EG) and H = (V, EH) over the same set of vertices and given a set of colors C, the impact on H of a coloring c : V → C of G, denoted I ( c ) , is the number of edges ij ∈ EH such that c(i) = c(j). In this setting, the max