Buscar
Mostrando ítems 1-9 de 9
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
(Elsevier, 2011-11)
The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacks and repacking is not ...
A polyhedral approach for the equitable coloring problem
(Elsevier Science, 2014-02)
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be ...
Polyhedral results for the equitable coloring problem
(Elsevier, 2011)
A tabu search heuristic for the equitable coloring problem
(Springer-v D I Verlag Gmbh, 2014-03)
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally ...
Soft Graph ColoringColoración de gráficas suaves
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2015)
Coloração total em grafos potência de cicloTotal coloring on power of cycle graphs
(Universidade Federal do Rio de JaneiroBrasilInstituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de EngenhariaPrograma de Pós-Graduação em Engenharia de Sistemas e ComputaçãoUFRJ, 2021)
Algorithms, parameters and complexity for graph partitioning problems
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOPrograma de Pós-Graduação em Ciência da ComputaçãoUFMG, 2019-06-27)
Problemas de partição em grafos modelam diferentes tarefas do mundo real, como alocação de recursos ou design de redes tolerantes a falhas. Geralmente, esse problemas são NP-difíceis, e projetar algoritmos cuja complexidade ...
Estudio poliedral y algoritmo branch-and-cut para el problema de coloreo equitativo en grafosA polyhedral study and a Branch-and-Cut algorithm for the equitable graph coloring problem
(Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires, 2012)