Buscar
Mostrando ítems 1-10 de 785
Polyhedral study of the maximum common induced subgraph problem
(Springer, 2016)
Improving the efficiency of the Branch and Bound algorithm for integer programming based on "flatness" information
(ELSEVIER SCIENCE BV, 2006)
This paper describes a strategy for defining priorities for the branching variables in a Branch and Bound algorithm. The strategy is based on shape information about the polyhedron over which we are optimizing. This ...
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 ...
Um método branch & bound para maximizar o valor de projetos de software para o negócio
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2016)
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)
Adaptive filtering strategy for numerical constraint satisfaction problems
(Elsevier Ltd, 2015)