Search
Now showing items 1-10 of 76
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
(2007-01-01)
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 ...
U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem
(ELSEVIER SCI LTD, 2010)
This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function ...
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
(Elsevier, 2015)
This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications ...
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 ...
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 ...
Specialised branch-and-bound algorithm for transmission network expansion planning
(Institute of Electrical and Electronics Engineers (IEEE), 2001-09-01)
An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging ...
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 ...
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 ...