Buscar
Mostrando ítems 1-10 de 95
A branch-and-price approach for the partition coloring problem
(Elsevier Science BvAmsterdamHolanda, 2011)
A branch-and-price algorithm for the (k,c)-coloring problem
(John Wiley & Sons Inc, 2015-07)
In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c ...
A branch-and-cut-and-price approach for the capacitated m-ring-star problem
(Elsevier Science BvAmsterdamHolanda, 2012)
Algoritmos branch-and-cut-and-price para o problema da árvore geradora de custo mínimo com restrição de grau
(Universidade Federal de Minas GeraisUFMG, 2014-04-10)
Given an undirected graph G = (V, E) with weighted edges and positive integers dv associated with each vertex v ∈ V , the Degree-Constrained Minimum Spanning Tree Problem (DCMST) consists in nding a minimum cost ...
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
(ELSEVIER, 2010)
In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot ...
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...