6 results on '"Javier Marenco"'
Search Results
2. An integer programming approach to b-coloring.
3. Polyhedral studies of vertex coloring problems: The standard formulation.
4. A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.
5. Cycle-based facets of chromatic scheduling polytopes.
6. Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.