Buscar
Mostrando ítems 1-10 de 211
Polyhedral study of the maximum common induced subgraph problem
(Springer, 2016)
A branch-and-bound algorithm for the multi-stage transmission expansion planning
(2005-10-31)
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 for the multi-stage transmission expansion planning
(2005-10-31)
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 ...
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 ...
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 ...