Buscar
Mostrando ítems 1-10 de 299
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-cut-and-price approach for the capacitated m-ring-star problem
(Elsevier Science BvAmsterdamHolanda, 2012)
Polyhedral study of the maximum common induced subgraph problem
(Springer, 2016)
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 cut algorithm for the hierarchical network design problem
(ELSEVIER SCIENCE BV, 2010)
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting ...
Localização de sensores de tráfego com limitações quanto ao número de equipamentos e de faixas observadas : técnicas heurísticas e um branch-and-cut
(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 TransportesUFRJ, 2020)