Buscar
Mostrando ítems 41-50 de 373
Transmission system expansion planning by a branch-and-bound algorithm
(Inst Engineering Technology-iet, 2008-01-01)
A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer ...
Lower bounding schemes for flowshops with blocking in-process
(Palgrave Publishers LtdBasingstokeInglaterra, 2001)
Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador
(2001-05-01)
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and ...
Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador
(2001-05-01)
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and ...
Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista
(Universidade Estadual Paulista (Unesp), 2017-09-06)
Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um ...
Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
(Institution Engineering Technology-iet, 2014)
Branch and bound algorithm for transmission system expansion planning using a transportation model
(Iee-inst Elec EngHertfordInglaterra, 2000)
Branch and bound algorithm for transmission system expansion planning using a transportation model
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor.
(Universidade Federal de São CarlosBRUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEP, 2004-12-13)
The purpose of this work is to develop exact methods, based on
Lagrangean and Surrogate relaxation, with good performance to solve the
manufacturer s pallet loading problem. This problem consists of orthogonally arranging
the ...
A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)
(Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas., 2015-03-01)
This paper addresses the Resource Constrained Project Scheduling Problem (RCPSP). For its solution, a hybrid methodology, which uses a Branch and Bound basic algorithm with dominance rules, is developed and implemented, ...