Buscar
Mostrando ítems 1-10 de 204
Polyhedral study of the maximum common induced subgraph problem
(Springer, 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)
Column generation bounds for numerical microaggregation
(Springer, 2014-02-18)
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 ...