Now showing items 11-20 of 201
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 ...
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 ...
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
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 ...
Branch and bound algorithm for transmission network expansion planning using DC model
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
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 ...