| Computational complexity of the capacitated lot size problem GR Bitran, HH Yanasse Management Science 28 (10), 1174-1186, 1982 | 790 | 1982 |
| Pesquisa operacional MN Arenales, VA Armentano, R Morabito Neto, HH Yanasse | 756 | 2007 |
| Deterministic approximations to stochastic production problems GR Bitran, HH Yanasse Operations Research 32 (5), 999-1018, 1984 | 157 | 1984 |
| The one-dimensional cutting stock problem with usable leftover–A heuristic approach AC Cherri, MN Arenales, HH Yanasse European Journal of Operational Research 196 (3), 897-908, 2009 | 133 | 2009 |
| Connections between cutting-pattern sequencing, VLSI design, and flexible machines A Linhares, HH Yanasse Computers & Operations Research 29 (12), 1759-1772, 2002 | 110 | 2002 |
| A hybrid heuristic to reduce the number of different patterns in cutting stock problems HH Yanasse, MS Limeira Computers & Operations Research 33 (9), 2744-2756, 2006 | 108 | 2006 |
| On a pattern sequencing problem to minimize the maximum number of open stacks HH Yanasse European Journal of Operational Research 100 (3), 454-463, 1997 | 106 | 1997 |
| An integrated cutting stock and sequencing problem HH Yanasse, MJP Lamosa European Journal of Operational Research 183 (3), 1353-1370, 2007 | 104 | 2007 |
| Approximation methods for the uncapacitated dynamic lot size problem GR Bitran, TL Magnanti, HH Yanasse Management Science 30 (9), 1121-1140, 1984 | 104 | 1984 |
| Two-dimensional cutting stock with multiple stock sizes HH Yanasse, ASI Zinober, RG Harris Journal of the Operational Research Society 42 (8), 673-683, 1991 | 101 | 1991 |
| The one-dimensional cutting stock problem with usable leftovers–A survey AC Cherri, MN Arenales, HH Yanasse, KC Poldi, ACG Vianna European Journal of Operational Research 236 (2), 395-402, 2014 | 91 | 2014 |
| Scheduling identical parallel machines with tooling constraints AC Beezão, JF Cordeau, G Laporte, HH Yanasse European Journal of Operational Research 257 (3), 834-844, 2017 | 84 | 2017 |
| A method for solving the minimization of the maximum number of open stacks problem within a cutting process JC Becceneri, HH Yanasse, NY Soma Computers & operations research 31 (14), 2315-2332, 2004 | 76 | 2004 |
| Linear models for 1-group two-dimensional guillotine cutting problems HH Yanasse, R Morabito International Journal of Production Research 44 (17), 3471-3491, 2006 | 58 | 2006 |
| Special issue: Cutting and packing problems M Arenales, R Morabito, H Yanasse Pesquisa Operacional 19 (2), 107-299, 1999 | 58 | 1999 |
| The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic AC Cherri, MN Arenales, HH Yanasse International Transactions in Operational Research 20 (2), 189-199, 2013 | 52 | 2013 |
| A note on linear models for two-group and three-group two-dimensional guillotine cutting problems HH Yanasse, R Morabito International Journal of Production Research 46 (21), 6189-6206, 2008 | 42 | 2008 |
| An algorithm for determining the k-best solutions of the one-dimensional knapsack problem HH Yanasse, NY Soma, N Maculan Pesquisa Operacional 20, 117-134, 2000 | 37 | 2000 |
| Linear gate assignment: a fast statistical mechanics approach A Linhares, HH Yanasse, JRA Torreão IEEE Transactions on computer-aided design of integrated circuits and …, 1999 | 37 | 1999 |
| A transformation for solving a pattern sequencing problem in the wood cut industry HH Yanasse Pesquisa Operacional 17 (1), 57-70, 1997 | 36 | 1997 |
Reinaldo MorabitoProfessor of Federal University of Sao Carlos, Brazil在 ufscar.br 的电子邮件经过验证
