Navegação Ciências Exatas e da Terra por Autor "Buriol, Luciana Salete"
Resultados 1-18 de 18
-
Um algoritmo heurístico aplicado ao problema de escalonamento de médicos do Hospital de Clínicas de Porto Alegre
Meister, Tatiana Costa (2020) [Dissertação]O escalonamento de médicos consiste em definir em quais áreas e turnos do dia cada médico irá atuar para suprir as demandas de um hospital. Essa atividade geralmente é realizada mensalmente e deve obedecer dados contratuais, ... -
A branch-and-price algorith, for a compressor scheduling problem
Friske, Marcelo Wuttig (2016) [Dissertação]This work presents the study and application of a branch-and-price algorithm for solving a compressor scheduling problem. The problem is related to oil production and consists of defining a set of compressors to be activated, ... -
Branch & price for the virtual network embedding problem
Moura, Leonardo Fernando dos Santos (2015) [Dissertação]Virtualization allows one or more virtual networks to share physical infrastructures. The Virtual Network Embedding problem (VNEP) is one of the main challenges in the virtualization of physical networks. This problem ... -
Heuristic approaches for network problems
Stefanello, Fernando (2015) [Tese]In our highly connected world, new technologies provide continuous changes in the speed and efficiency of telecommunication and transportation networks. Many of these technologies come from research on network optimization ... -
Mathematical models and a late acceptance fix-and-optimize approach for a nurse rostering problem
Portella, Victoria Simonetti (2021) [Dissertação]The Nurse Rostering Problem (NRP) is a classic optimization problem that has been ex tensively studied due to its practical and theoretical importance. It consists of assigning a given set of nurses to work shifts distributed ... -
A matheuristic approach for solving the high school timetabling problem
Dornelles, Arton Pereira (2015) [Tese]The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of ... -
MOIRAE : a computational strategy to predict 3-D structures of polypeptides
Dorn, Márcio (2012) [Tese]Currently, one of the main research problems in Structural Bioinformatics is associated to the study and prediction of the 3-D structure of proteins. The 1990’s GENOME projects resulted in a large increase in the number ... -
Personnel rostering : models and algorithms for scheduling, rescheduling and ensuring robustness
Wickert, Toni Ismael (2019) [Tese]Existing academic literature contains a significant number of publications which address personnel rostering problems. Providing a variety of combinatorial optimization techniques such as metaheuristics, integer linear ... -
Scalable cost-efficient placement and chaining of virtual network functions
Luizelli, Marcelo Caggiani (2017) [Tese]Network Function Virtualization (NFV) is a novel concept that is reshaping the middlebox arena, shifting network functions (e.g. firewall, gateways, proxies) from specialized hardware appliances to software images running ... -
Service restoration and switch allocation in power distribution networks : bounds and algorithms
Benavides Rojas, Alexander Javier (2010) [Dissertação]A melhora da confiabilidade em redes de distribuição de energia elétrica é um tema importante para as indústrias de fornecimento de eletricidade, devido aos regulamentos estritos em muitos países. Depois de uma falha na ... -
Smoothed analysis in Nash equilibria and the Price of Anarchy
Rodrigues, Félix Carvalho (2012) [Dissertação]São analisados nesta dissertação problemas em teoria dos jogos, com enfoque no efeito que perturbações acarretam em jogos. A análise suavizada (smoothed analysis) é utilizada para tal análise, e dois tipos de jogos são o ... -
Solution methods for a maritime inventory routing problem
Friske, Marcelo Wuttig (2021) [Tese]This thesis presents a matheuristic framework and a metaheuristic approach for solving a Maritime Inventory Routing Problem (MIRP). The problem combines two main components: ship routing and inventory management at ports. ... -
Solving moving-blocks problems
Pereira, André Grahl (2016) [Tese]In this thesis, we study the class of moving-blocks problems. A moving-blocks problem consists of k movable blocks placed on a grid-square maze where there is an additional movable block called the man, which is the only ... -
A study on the home care routing and scheduling problem
Kummer Neto, Alberto Francisco (2021) [Tese]This thesis approaches the home health care problem, focusing on the routing problems surrounding such systems. These problems are especially important due to the world wide tendency of increased life expectancy and, ... -
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Pinheiro, Tiago Furtado Drehmer (2022) [Dissertação]In this work, we study the k-labeled spanning forest problem (KLSF). The input of the KLSF is an undirected graph with labeled edges and a positive integer k. The goal is to find a spanning forest of the graph with at most ... -
The pickup and delivery problem with time windows : algorithms, instances, and solutions
Sartori, Carlo Sulzbach (2019) [Dissertação]This work considers the Pickup and Delivery Problem with Time Windows. It is a hard combinatorial optimization problem that generalizes a number of vehicle routing problem and finds applications in courier and dial-a-ride ... -
The state of the art in MILP formulations for the guillotine 2D knapsack and related problems
Becker, Henrique (2022) [Tese]This thesis advances the state of the art in Mixed-Integer Linear Programming (MILP) formulations for Guillotine 2D Cutting Problems by (i) proposing a (re-)formulation that improves on a state-of-the-art formulation by ... -
The unbounded knapsack problem : a critical review
Becker, Henrique (2017) [Dissertação]A review of the algorithms and datasets in the literature of the Unbounded Knapsack Problem (UKP) is presented in this master's thesis. The algorithms and datasets used are brie y described in this work to provide the ...