170 resultados para branch and bound algorithm


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Elétrica - FEIS

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In the present work the scattering of a fermion in the modified Hulthen potential is considered with a general vector and scalar and we solved the Dirac equation in the one-dimensional space. The transmission and reflection coefficients are reported. The bound-state solution is also given. The study shows the asymptotic behavior of the wave function in bound-state and scattering states solutions.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

O problema tratado neste trabalho consiste em cortar uma placa retangular em peças menores retangulares, de modo que a perda seja minimizada. A placa, entretanto, contém defeitos bem localizados. Propomos uma abordagem em grafo E/OU para representação das soluções possíveis e um método de enumeração implícita para determinar a solução ótima. Resultados computacionais demonstram a efetividade da abordagem.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We consider the two-level network design problem with intermediate facilities. This problem consists of designing a minimum cost network respecting some requirements, usually described in terms of the network topology or in terms of a desired flow of commodities between source and destination vertices. Each selected link must receive one of two types of edge facilities and the connection of different edge facilities requires a costly and capacitated vertex facility. We propose a hybrid decomposition approach which heuristically obtains tentative solutions for the vertex facilities number and location and use these solutions to limit the computational burden of a branch-and-cut algorithm. We test our method on instances of the power system secondary distribution network design problem. The results show that the method is efficient both in terms of solution quality and computational times. © 2010 Elsevier Ltd.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The aim of this work is the application of the Interior Point and Branch and Bound methods in multiobjective optimization models related to sugarcane harvest residual biomass. These methods showed their viability to help on choosing the sugarcane planting varieties, searching to optimize cost and energy balance of harvest residual biomass, which have conflitant objectives. These methods provide satisfactory results, with fair computing performance and reliable and consistent solutions to the analyzed models. © 2011 IEEE.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Elétrica - FEIS

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The Klein - Gordon and the Dirac equations with vector and scalar potentials are investigated under a more general condition, V(v) + V(s) = constant. These intrinsically relativistic and isospectral problems are solved in the case of squared hyperbolic potential functions and bound states for either particles or antiparticles are found. The eigenvalues and eigenfuntions are discussed in some detail and the effective Compton wavelength is revealed to be an important physical quantity. It is revealed that a boson is better localized than a fermion when they have the same mass and are subjected to the same potentials.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The growth of maize (Zea mays L.) kernels depends on the availability of carbon (C) and nitrogen (N) assimilates supplied by the mother plant and the capacity of the kernel to use them. Our objectives were to study the effects of N and sucrose supply levels on growth and metabolism of maize kernels. Kernel explants of Pioneer 34RO6 were cultured in vitro with varying combinations of N (5 to 30 mM) and sucrose (117 to 467 mM). Maximum kernel growth was obtained with 10 mM N and 292 mM sucrose in the medium, and a deficiency of one assimilate could not be overcome by a sufficiency of the other. Increasing the N supply led to increases in the kernel sink capacity (number of cells and starch granules in the endosperm), activity of certain enzymes (soluble and bound invertases, sucrose synthase, and aspartate aminotransaminase), starch, and the levels of N compounds (total-N, soluble protein, and free amino acids), and decreased the levels of C metabolites (sucrose and reducing sugars). Conversely, increasing the sucrose supply increased the level of endosperm C metabolites, free amino acids, and ADPG-PPase and alanine transaminase activities, but decreased the activity of soluble invertase and concentrations of soluble protein and total-N. Thus, while C and N are interdependent and essential for accumulation of maximum kernel weight, they appear to regulate growth by different means. Nitrogen supply aids the establishment of kernel sink capacity, and promotes activity of enzymes relating to sucrose and nitrogen uptake, while sucrose regulates the activities df invertase and ADPG-PPase. (C) 1999 Annals of Botany Company.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)