Buscar
Mostrando ítems 31-40 de 296
A single vehicle routing problem with fixed delivery and optional collections
(TAYLOR & FRANCIS INC, 2009)
The Single-Vehicle Routing Problem with Fixed Delivery and Optional Collections considers a set of delivery customers receiving goods from a depot and a set of collection customers sending goods to the same depot. All ...
An exact algorithm for the edge coloring by total labeling problem
(Springer, 2018-07)
This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels ...
Formulações e algoritmos sequenciais e paralelos para o problema da árvore geradora de custo mínimo com restrição de grau mínimo
(Universidade Federal de Minas GeraisUFMG, 2012-02-13)
Given an edge weighted undirected graph G and a positive integer d, the Min-degree Constrained Minimum Spanning Tree Problem (MDMST) consists of finding a minimum cost spanning tree T of G, such that each vertex is either ...
The crew scheduling and routing problem in road restoration
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEPCâmpus São Carlos, 2020-03-27)
Extreme events as large-scale disasters can cause partial or total disruption of basic services such as water, energy, communication and transportation. In particular, recovering the transportation infrastructure is of ...
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
(Elsevier Science BvAmsterdamHolanda, 2000)
A column generation approach for SONET ring assignment
(John Wiley & Sons IncHobokenEUA, 2006)
Exact approaches for network topology and routing problems
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOPrograma de Pós-Graduação em Ciência da ComputaçãoUFMG, 2021-05-18)
Nesta tese, investigamos abordagens de solução exata para o p-arborescence star
problem (p-ASP) e o pickup and delivery traveling salesman problem with multiple
stacks (PDTSPMS). Esses dois problemas de otimização ...
On exact solutions for the Minmax Regret Spanning Tree problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2014)
An exact approach to the problem of extracting an embedded network matrix
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)