Now showing items 1-10 of 201
A branch-and-bound algorithm for the multi-stage transmission expansion planning
This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models ...
A Branch and Bound algorithm to solve nonconvex MINLP problems via novel division strategy: An electric power system case study
This paper presents two Branch and Bound algorithms (B&B) for solving mixed-integer nonlinear programming (MINLP) problems with nonconvex search space. The main advantage of the proposed algorithms, comparing with the ...
A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem
In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of ...
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
(SOC BRASILEIRA MATEMATICA APLICADA & COMPUTACIONAL, 2010)
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 ...
Global optimization for the ℋ∞-norm model reduction problem
A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and ...