Thiago Alves de Queiroz

Orcid: 0000-0003-2674-3366

According to our database1, Thiago Alves de Queiroz authored at least 38 papers between 2012 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

An Optimization-Based Decision Support System for Multi-trip Vehicle Routing Problems.
SN Comput. Sci., 2024

A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery.
Eur. J. Oper. Res., 2024

Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model.
Comput. Oper. Res., 2024

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

Optimizing a Car Patrolling Application by Iterated Local Search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

A Re-optimization Heuristic for a Dial-a-Ride Problem in the Transportation of Patients.
Proceedings of the Metaheuristics - 15th International Conference, 2024

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

Dynamic scheduling of patients in emergency departments.
Eur. J. Oper. Res., 2023

A Decision Support System for Multi-Trip Vehicle Routing Problems.
Proceedings of the 25th International Conference on Enterprise Information Systems, 2023

2022
The static stability of support factor-based rectangular packings: an assessment by regression analysis.
Int. Trans. Oper. Res., 2022

A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints.
Appl. Soft Comput., 2022

A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts.
Ann. Oper. Res., 2022

A VNS Based Heuristic for a 2D Open Dimension Problem.
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

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

2021
Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm.
Comput. Oper. Res., 2021

An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery.
Comput. Oper. Res., 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

Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search.
Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

A Variable Neighborhood Heuristic for Facility Locations in Fog Computing.
Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

2020
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time.
Int. Trans. Oper. Res., 2020

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

A Location-allocation Model for Fog Computing Infrastructures.
Proceedings of the 10th International Conference on Cloud Computing and Services Science, 2020

2019
Multi-objective Basic Variable Neighborhood Search for Portfolio Selection.
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

2018
Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem.
Electron. Notes Discret. Math., 2018

Two effective simulated annealing algorithms for the Location-Routing Problem.
Appl. Soft Comput., 2018

Exact Method for the Container Loading Problem with Priority and Stability.
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

Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches.
Comput. Ind. Eng., 2017

2016
Heuristics for a hub location-routing problem.
Networks, 2016

Dynamic cargo stability in loading and transportation of containers.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2016

2015
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns.
4OR, 2015

2014
Order and static stability into the strip packing problem.
Ann. Oper. Res., 2014

The Knapsack Problem with Three Practical Constraints.
Proceedings of the International Conference on Computational Science, 2014

2013
Approaches for the 2D 0-1 knapsack problem with conflict graphs.
Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013

2012
Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape.
Expert Syst. Appl., 2012

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.
Comput. Oper. Res., 2012

A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape.
Proceedings of the 2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012


  Loading...