Marina Andretta

Orcid: 0000-0002-7068-6947

Affiliations:
  • University of São Paulo, Brazil


According to our database1, Marina Andretta authored at least 12 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands.
Int. Trans. Oper. Res., 2022

2021
New exact algorithms for planar maximum covering location by ellipses problems.
Eur. J. Oper. Res., 2021

A Genetic Algorithm for the Nesting Problem With Continuous Rotations.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
Two effective methods for the irregular knapsack problem.
Appl. Soft Comput., 2020

2018
A general heuristic for two-dimensional nesting problems with limited-size containers.
Int. J. Prod. Res., 2018

Packing Circles and Irregular Polygons using Separation Lines.
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items.
Proceedings of the XLIV Latin American Computer Conference, 2018

2017
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster.
Expert Syst. Appl., 2017

2016
Robust mixed-integer linear programming models for the irregular strip packing problem.
Eur. J. Oper. Res., 2016

2013
Deterministic and stochastic global optimization techniques for planar covering with ellipses problems.
Eur. J. Oper. Res., 2013

2010
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization.
Numer. Algorithms, 2010

2008
Topics on linearly-constrained optimization.
PhD thesis, 2008


  Loading...