Buscar
Mostrando ítems 21-30 de 4442
Comparison of mip models for the integrated lot-sizing and one-dimensional cutting stock problem
(2016-01-01)
Production processes comprising both the lot-sizing problem and the cutting stock problem are frequent in various industrial sectors. However these problems are usually treated separately, which can generates suboptimal ...
Problemas de corte guilhotinado e restritos: formulações matemáticas e métodos de solução
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEPCâmpus São Carlos, 2019-12-12)
We address the Constrained Guillotine Cutting Problems (CGCP) in this doctoral thesis. The CGCP consist of producing items from objects using guillotine cuts, i.e., cuts that divide the rectangular materials into two ...
Evaluation and development of passion fruit (Passiflora alata Dryander) propagated by cutting and seet in conditions of commercial orchard
(Soc Brasileira Fruticultura, 2008-09-01)
The present work was conducted in a fruit tree propagation area of the Plant Production Department of the Faculdade de Ciencias Agrarias e Veterinarias, Universidade Estadual Paulista (FCAV/UNESP) in Jaboticabal, SP, and ...
Evaluation and development of passion fruit (Passiflora alata Dryander) propagated by cutting and seet in conditions of commercial orchard
(Soc Brasileira Fruticultura, 2008-09-01)
The present work was conducted in a fruit tree propagation area of the Plant Production Department of the Faculdade de Ciencias Agrarias e Veterinarias, Universidade Estadual Paulista (FCAV/UNESP) in Jaboticabal, SP, and ...
Influence of HSM cutting parameters on the surface integrity characteristics of hardened AISI H13 steel
(Heidelberg, 2014-03-07)
The purpose of this study is to evaluate the influence of the cutting parameters of high-speed machining milling on the characteristics of the surface integrity of hardened AISI H13 steel. High-speed machining has been ...
SEMIDEFINITE PROGRAMMING BASED ALGORITHMS for the SPARSEST CUT PROBLEM
(Cambridge Univ Press, 2011-04-01)
In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. the relaxed formulation ...