Buscar
Mostrando ítems 1-10 de 298
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 ...
Polyhedral study of the maximum common induced subgraph problem
(Springer, 2016)
A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste
(2017-02-01)
This paper proposes a hybrid approach for solving the multi-objective model related to the minimisation of sugar cane waste collection costs and/or the maximisation of produced energy by this waste, with the aid of strategies ...
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 ...
Lower bounding schemes for flowshops with blocking in-process
(Palgrave Publishers LtdBasingstokeInglaterra, 2001)
A beam-search approach to the set covering problem
(Springer Verlag, 2016)