Buscar
Mostrando ítems 1-10 de 176
A branch-and-cut-and-price approach for the capacitated m-ring-star problem
(Elsevier Science BvAmsterdamHolanda, 2012)
A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
(European Journal of Operational Research, 2018)
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 ...
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 ...
Cargo Consolidation and Distribution Through a Terminals-Network: A Branch-And-Price Approach
(Universidad Federal de Santa Catarina, 2017-09)
Less-than-truckload is a transport modality that includes many practical variations to convey a number of transportation-requests from the origin locations to their destinations by using the possibility of goods-transshipments ...
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 ...