Steiner Problem
Mostrando 1-11 de 11 artigos, teses e dissertações.
-
1. QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM
ABSTRACT The Traveling Salesman Problem (TSP) is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time)-hard problem, there are several heuristic methods which have been proposed for the past decades in the attempt to solv
Pesqui. Oper.. Publicado em: 2015-12
-
2. AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS
Random key genetic algorithms are heuristic methods for solving combinatorial optimization problems. They represent solutions as vectors of randomly generated real numbers, the so-called random keys. A deterministic algorithm, called a decoder, takes as input a vector of random keys and associates with it a feasible solution of the combinatorial optimization
Pesqui. Oper.. Publicado em: 2014-08
-
3. O problema do corredor de comprimento mínimo : algoritmos exatos, aproximativos e heurísticos / The minimum length corridor problem : exact, approximative and heuristic algorithms
Esta dissertação tem como foco a investigação experimental de algoritmos exatos, aproximativos e heurísticos aplicados na resolução do chamado problema do corredor de comprimento mínimo (PCCM). No PCCM recebemos um polígono retilinear P e um conjunto de polígonos retilineares menores formando uma subdivisão S planar conexa de P. Uma solução para
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/05/2012
-
4. Maze routing steiner trees with delay versus wire length tradeoff
In this paper, we address the problem of generating good topologies of rectilinear Steiner trees using path search algorithms. Various techniques have been applied in order to achieve acceptable run times on a Maze Router that builds Steiner trees. A biasing technique proposed for wire length improvement, produces trees that are within 2% from optimal topolo
Publicado em: 2011
-
5. Árvores de Steiner: Teoria, Geração Numérica e Aplicações / Steiner trees: Theory, Numerical Generation and Applications
Given a set of points in the plane, which we call terminals, one proves that they are always connected by a minimal graph called Steiner tree. The terminals may represent main connection route points, circuit elements or network computer servers. That is, the problem is to optimize traffic among the terminals whenever this is represented by a tree of shortes
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 16/12/2009
-
6. Otimização no serviço de saúde no estado do Paraná: fluxo de pacientes e novas configurações hierárquicas
This paper presents a proposal for optimizing the public health service in the state of Parana in terms of the flow of patients within the state's boundaries and the regionalization (division) of the state into new hierarchical configurations for this service. In terms of regionalization, the proposal consists of dividing the state into smaller regions compr
Gestão & Produção. Publicado em: 2008-08
-
7. Acquisition and processing of morphometric parameters derivatives from SRTM model / Aquisição e processamento de dados morfométricos derivados do modelo digital de elevação SRTM
SRTM data is distributed at horizontal resolution of 1arcsec (aprox. 30m) for areas within the USA and at 3arcsec (aprox. 90m) resolution for the rest of the world. A 90m resolution can be considered suitable for small or medium-scale analysis, but it is too coarse for more detailed purposes. One alternative is to interpolate the SRTM data at a finer resolut
Publicado em: 2007
-
8. Aproximação e compartilhamento de custos em projeto de redes / Approximation and cost-sharing in network design
We consider the interplay of two areas: combinatorial optimization and cost-sharing in network design problems. In the first, we are interested to find a solution with small cost. In the second we would like to share the solution cost between its users. We present algorithms for the problems Connected Facility Location and Rent-or-Buy . These two problems ar
Publicado em: 2006
-
9. Planejamento de redes WDM com proteção para caminhos opticos
This dissertation is a study about the initial traffic deployment in wavelength-routed WDM (Wavelength Division Multiplexing) optical networks with path protection. We make an introduction of the key technologies and the major network planning aspects. We introduce some architectures for transport provisioning to various client network architectures. The RWA
Publicado em: 2004
-
10. ANÁLISE CONVEXA E MÉTODOS LIFT-AND-PROJECT PARA PROGRAMAÇÃO INTEIRA / CONVEX ANALYSIS AND LIFT-AND-PROJECT METHODS FOR INTEGER PROGRAMMING / ANÁLISIS CONVEXA Y MÉTODOS LIFT-AND-PROJECT PARA PROGRAMACIÓN ENTERA
Algorithms for general 0-1 mixed integer programs can be successfully developed by using lift-and-project methods to generate cuts. Cuts are generated by solving a cut- generation-program that depends on a certain normalization. From a theoretical point of view, the good numerical behavior of these cuts is not completely understood yet, specially, concerning
Publicado em: 2001
-
11. THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY / O PROBLEMA DE STEINER NA MÉTRICA RETILÍNEA: PROPRIEDADES, NOVAS HEURÍSTICAS E ESTUDO COMPUTACIONAL
In this dissertation we present a survey about the Steiner problem in the rectilinear metric, illustrating its applications to the VLSI desing. A large number of heurístics already described in literature is studied in details. Moreover, we study the complexity of these heuristics and the quality of their solutions. New results concerning their worst case b
Publicado em: 1989