Vinícius Loti de Lima

Orcid: 0000-0002-4805-4468

According to our database1, Vinícius Loti de Lima authored at least 13 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithms for the bin packing problem with scenarios.
J. Comb. Optim., November, 2024

Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach.
Comput. Oper. Res., 2024

2023
The integrated lot-sizing and cutting stock problem under demand uncertainty.
Int. J. Prod. Res., October, 2023

Heuristic algorithms for integrated workforce allocation and scheduling of perishable products.
Int. J. Prod. Res., October, 2023

Exact solution of network flow models with strong relaxations.
Math. Program., February, 2023

2022
2DPackLib: a two-dimensional cutting and packing library.
Optim. Lett., 2022

Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res., 2022

A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem.
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022

Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS.
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

2021
Exact solution techniques for two-dimensional cutting and packing.
Eur. J. Oper. Res., 2021

New Exact Techniques Applied to a Class of Network Flow Formulations.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Integrated Workforce Scheduling and Flexible Flow Shop Problem in the Meat Industry.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2020
Grids for cutting and packing problems: a study in the 2D knapsack problem.
4OR, 2020


  Loading...