Buscar
Mostrando ítems 31-40 de 298
Comparação entre diferentes formas de obtenção da solução inicial para a aplicação do método Branch-and-Bound para solucionar problemas de sequenciamento em ambientes Flow-Shop com bloqueio
(Universidade Tecnológica Federal do ParanáCornelio ProcopioBrasilEngenharia MecânicaUTFPR, 2015)
The objective of this paper is to compare the use of different methods to obtain an initial solution for the Branch-and-Bound algorithm with the objective of minimizing the makespan in a flow shop with zero buffer environment. ...
Branch and bound algorithm for transmission system expansion planning using a transportation model
(Institute of Electrical and Electronics Engineers (IEEE), 2000-05-01)
A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem ...
Branch and bound algorithm for transmission system expansion planning using a transportation model
(Institute of Electrical and Electronics Engineers (IEEE), 2000-05-01)
A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem ...
Reformulation in mathematical programming: An application to quantum chemistry
(Elsevier Science BvAmsterdamHolanda, 2009)
Programação linear, linear inteira e os algoritmos Simplex e Branch and Bound: Problemas e aplicações em otimização
(Universidade Federal de São CarlosUFSCarCâmpus São CarlosCiência da Computação - CC, 2021-06-17)
Optimization problems are those in which the objective is to maximize or minimize a function, called an objective function. In the optimization process, restrictions on decision variables are determined, according to which ...
Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
(Institution Engineering Technology-iet, 2007-03-01)
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical ...
Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
(Institution Engineering Technology-iet, 2007-03-01)
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical ...
An analysis of the branch-and-bound method in solving the reactive optimal power flow problem
(2017-10-20)
The purpose of an Optimal Power Flow (OPF) problem is to determine the state of an electric power transmission system that optimizes a given system performance and satisfies its physical and operational constraints. The ...
An Analysis of the Branch-and-Bound Method in Solving the Reactive Optimal Power Flow Problem
(Ieee, 2017-01-01)
The purpose of an Optimal Power Flow (OPF) problem is to determine the state of an electric power transmission system that optimizes a given system performance and satisfies its physical and operational constraints. The ...