Topics on linearly-constrained optimization. - Marina Andretta (2008)

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization. - Marina Andretta; Ernesto G. Birgin; José Mario Martínez (Numer. Algorithms, 2010)

Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. - Marina Andretta; Ernesto G. Birgin (Eur. J. Oper. Res., 2013)

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)

A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. - Leandro Resende Mundim; Marina Andretta; Thiago Alves de Queiroz (Expert Syst. Appl., 2017)

Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items. - Layane Rodrigues de Souza Queiroz; Leandro Resende Mundim; Marina Andretta (CLEI, 2018)

Packing Circles and Irregular Polygons using Separation Lines. - Jeinny Peralta; Marina Andretta; José Fernando Oliveira (ICORES, 2018)

A general heuristic for two-dimensional nesting problems with limited-size containers. - Leandro Resende Mundim; Marina Andretta; Maria Antónia Carravilla; José Fernando Oliveira (Int. J. Prod. Res., 2018)

Two effective methods for the irregular knapsack problem. - Layane Rodrigues de Souza Queiroz; Marina Andretta (Appl. Soft Comput., 2020)

A Genetic Algorithm for the Nesting Problem With Continuous Rotations. - Wesley H. B. Nunes; Mayron C. O. Moreira; Marina Andretta (CEC, 2021)

New exact algorithms for planar maximum covering location by ellipses problems. - Danilo Tedeschi; Marina Andretta (Eur. J. Oper. Res., 2021)

A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. - Layane Rodrigues de Souza Queiroz; Marina Andretta (Int. Trans. Oper. Res., 2022)