Buscar
Mostrando ítems 1-10 de 326
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 beam-search approach to the set covering problem
(Springer Verlag, 2016)
Adaptive filtering strategy for numerical constraint satisfaction problems
(Elsevier Ltd, 2015)
Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor.
(Universidade Federal de São CarlosBRUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEP, 2004-12-13)
The purpose of this work is to develop exact methods, based on
Lagrangean and Surrogate relaxation, with good performance to solve the
manufacturer s pallet loading problem. This problem consists of orthogonally arranging
the ...
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)
Optimal energy generation with biomass of sugarcane harvest
(2011-05-31)
The aim of this work is the application of the Interior Point and Branch and Bound methods in multiobjective optimization models related to sugarcane harvest residual biomass. These methods showed their viability to help ...
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 method for solving integer separable concave problems
(KLUMER ACADEMIC PUBL, 2003)