Marenco Javier

Javier Marenco

Information about the author Javier Marenco will soon be added to the site.
Found 3 papers in total
The maximum-impact coloring polytope
The maximum-impact coloring polytope
2017
Given two graphs G=(V,EG) and H=(V,EH) over the same set of vertices and given a set...
A branch‐and‐cut algorithm for the minimum‐adjacency vertex coloring problem
A branch‐and‐cut algorithm for the minimum‐adjacency vertex coloring problem
2011
In this work we study a particular way of dealing with interference in combinatorial...
Facets of the graph coloring polytope
Facets of the graph coloring polytope
2002
In this paper we present a study of the polytope associated to a classic linear...
Papers per page: