Branch And Bound Algorithm
Mostrando 1-12 de 23 artigos, teses e dissertações.
-
1. Direct block scheduling technology: Analysis of Avidity
Abstract This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology) which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit. Each block is analyzed individually in order to define the best target period. This methodology presents an improvement of the
REM, Int. Eng. J.. Publicado em: 2018-03
-
2. STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
ABSTRACT In this paper, we study the stochastic knapsack problem with expectation constraint. We solve the relaxed version of this problem using a stochastic gradient algorithm in order to provide upper bounds for a branch-and-bound framework. Two approaches to estimate the needed gradients are studied, one based on Integration by Parts and one using Finite
Pesqui. Oper.. Publicado em: 2017-09
-
3. Development and application of an automatic tool for the selection of control variables based on the self-optimizing control methodology
Abstract Rules for control structure design for industrial processes have been extensively proposed in the literature. Some model-based methodologies have a sound mathematical basis, such as the self-optimizing control technology. The procedure can be applied with the aid of available commercial simulators, e.g., PRO/IITM and AspenPlus®, from which the conv
Braz. J. Chem. Eng.. Publicado em: 2017-07
-
4. ESTRATÉGIAS PARALELAS INTELIGENTES PARA O MÉTODO BRANCH-AND-BOUND APLICADAS AO PROBLEMA DO CAIXEIRO VIAJANTE ASSIMÉTRICO / PARALLEL STRATEGIES FOR INTELLIGENT METHOD BRANCH-AND-BOUND TO APPLY traveling salesman problem ASYMMETRICAL
To the use of different architectures to process distinct portions of the same code, in order to maximize the performance, it is given the name Heterogeneous Computing. The Heterogeneous Computing is closely related to the high performance computing, and raised in a moment when the parallel computers, in that time with homogeneous execution, could no longer
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 25/07/2012
-
5. A robustez de um sistema de distribuição e a alocação de medidores de qualidade da energia elétrica frente aos afundamentos de tensão / The robustness of a distribution system and an allocation of power quality monitors in the face of the voltage sags
This dissertation aims to initially reintroduce and spread the Fault Positions Method (FPM) as an analytic means to determine the remaining voltage in all bus bar constituents of a Distribution System (DS), upon the occurrence of voltage sags. By applying this method, it is possible to formulate the during fault voltage matrix, thus denoting the influence an
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/03/2012
-
6. The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound
Computational & Applied Mathematics. Publicado em: 2010-06
-
7. Proposta de solução de problemas de scheduling considerando possibilidade de terceirização usando a técnica de otimização por colônia de formigas
Althought the scheduling-related literature has a high level of diversity, just a small group have been considering the possibility of outsource a set of tasks. During a literature review, only two papers related to this theme were found, both dealing on scheduling projects with outsource possibilities on single-machine environments. Along with this scenario
Publicado em: 2010
-
8. Recuperação de imagens multiescala intervalar / Image retrieval by interval multiscale
We present a general method for content-based image retrieval (CBIR) in large image collections, using multiscale interval distance estimation. We consider specifically queries by example, where the goal is to find the image in the collection that is closest to a given image, according to some image distance function. In this work we do not aim to develop me
Publicado em: 2010
-
9. Polyhedral study of the maximum common induced subgraph problem / Estudo poliedral do problema do maximo subgrafo induzido comum
O problema do Máximo Subgrafo Induzido Comum (MSIC) pertence a classe NP-difícil e possui aplicações em diversas áreas. Apesar de sua complexidade, ainda é importante conhecer soluções exatas para instâncias deste problema. Os algoritmos exatos encontrados na literatura buscam resolvê-lo através de técnicas de backtracking ou através de sua redu
Publicado em: 2009
-
10. 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
-
11. Evaluation of optimal and suboptimal feature selection methods applied to image textures / Avaliação de métodos ótimos e subótimos de seleção de características de texturas em imagens
Texture features are eficient image descriptors and can be employed in a wide range of applications, such as classification and segmentation. However, when the number of features is considerably high, pattern recognition tasks may be compromised. Feature selection helps prevent this problem, as it can be used to reduce data dimensionality and reveal features
Publicado em: 2008
-
12. Um algoritmo exato para a otimização de carteiras de investimento com restrições de cardinalidade / An exact algorithm for portifolio optimization with cardinality constraints
Neste trabalho, propomos um método exato para a resolução de problemas de programação quadrática que envolvem restrições de cardinalidade. Como aplicação, empregamos o método para a obtenção da fronteira eficiente de um problema (bi-objetivo) de otimização de carteiras de investimento. Nosso algoritmo é baseado no método Branch-and-Bound. A
Publicado em: 2008