Determining the K-best solutions of knapsack problems. - Aline Aparecida de Souza Leão; Luiz Henrique Cherri; Marcos Nereu Arenales (Comput. Oper. Res., 2014)

Robust mixed-integer linear programming models for the irregular strip packing problem. - Luiz Henrique Cherri; Leandro Resende Mundim; Marina Andretta; Franklina Maria Bragion Toledo; José Fernando Oliveira; Maria Antónia Carravilla (Eur. J. Oper. Res., 2016)

An Imperialist Competitive Algorithm for a Real-World Flexible Job Shop Scheduling Problem. - Willian Tessaro Lunardi; Holger Voos; Luiz Henrique Cherri (ETFA, 2018)

A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints. - Willian Tessaro Lunardi; Luiz Henrique Cherri; Holger Voos (ICAISC (1), 2018)

An innovative data structure to handle the geometry of nesting problems. - Luiz Henrique Cherri; Adriana Cristina Cherri; Maria Antónia Carravilla; José Fernando Oliveira; Franklina Maria Bragion Toledo; Andréa Carla Gonçalves Vianna (Int. J. Prod. Res., 2018)

Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. - Luiz Henrique Cherri; Adriana Cristina Cherri; Edilaine Martins Soler (J. Glob. Optim., 2018)

An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem. - Willian Tessaro Lunardi; Holger Voos; Luiz Henrique Cherri (SAC, 2019)

A stochastic programming approach to the cutting stock problem with usable leftovers. - Adriana Cristina Cherri; Luiz Henrique Cherri; Beatriz Brito Oliveira; José Fernando Oliveira; Maria Antónia Carravilla (Eur. J. Oper. Res., 2023)