Buscar
Mostrando ítems 1-8 de 8
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 ...
O problema do subgrafo biconexo mínimo generalizado: algoritmos e formulações
(Universidade Federal de Minas GeraisUFMG, 2012-03-01)
Given an integer number k > 2 and an undirected simple graph G = (V; E) with positive real weights assigned to its edges, where V is partitioned into k subsets (or clusters), the Generalized Minimum Biconnected Subgraph ...
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 ...
Formulações e algoritmos em programação inteira para o problema do caixeiro viajante com coleta e entrega sobre carregamento lifo
(Universidade Federal de Minas GeraisUFMG, 2014-05-22)
This dissertation addresses the Pickup and Delivery Travelling Salesman Problem withMultiple Stacks and algorithmic approaches to obtain its exact solution. In this problem,a single vehicle must serve a set of customer ...
Heurísticas e algoritmo exato para o problema de roteamento de veículos com coleta e entrega simultâneas
(Universidade Federal de Minas GeraisUFMG, 2010-02-25)
This work adresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery, where routes must be devised to fulfil the pickup and delivery requests of a set of customers. Each customer must be served by only one ...
Algoritmos para o problema de roteamento de veículos capacitado com restrições de carregamento bidimensional
(Universidade Federal de Minas GeraisUFMG, 2013-03-18)
This work addresses the Capacitated Vehicle Routing Problem with two-dimensional loading constraints. Given a central depot and a set of clients, where each demands a specific amount of items, the problem aims to define ...
Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
(Universidade Federal de Minas GeraisUFMG, 2009-07-17)
In this work, we introduce models and optimization algorithms to improve the Quality of Service in Wireless Sensor Networks with multiple mobile sinks. A discrete event simulator that integrates the proposed optimization ...
Integração do controle de densidade, cobertura e roteamento em redes de sensores sem fio: modelos matemáticos, algoritmos de otimização e simulação
(Universidade Federal de Minas GeraisUFMG, 2011-08-04)
In this work, we introduce models and optimization algorithms to reduce the wireless sensor networks energy consumption, by integrating some common optimization problems to this network. A discrete event simulator is ...