Buscar
Mostrando ítems 21-30 de 71
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
(2013-01-01)
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 ...
A Faster Algorithm For Packing Branchings In Digraphs
(ELSEVIER SCIENCE BVAMSTERDAM, 2015)
Transmission system expansion planning by a branch-and-bound algorithm
(Inst Engineering Technology-ietHertfordInglaterra, 2008)
Planejamento de Fontes Reativas em Sistemas de Energia Elétrica utilizando a técnica de Decomposição de Benders e o algoritmo de Branch-and-Bound
(2001-05-01)
This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two ...
A column generation approach for SONET ring assignment
(John Wiley & Sons IncHobokenEUA, 2006)
A Branch-and-cut Algorithm For A Class Of Sum-of-ratios Problems
(ELSEVIER SCIENCE INCNEW YORK, 2015)
Tabu search for total tardiness minimization in flowshop scheduling problems
(Pergamon-elsevier Science LtdOxfordInglaterra, 1999)
Exact solutions of rectangular partitions via integer programming
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2000)