default search action
Thiago Alves de Queiroz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Mateus Martin
, Thiago Alves de Queiroz
Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model. Comput. Oper. Res. 167: 106651 (2024) - [j22]Beatrice Bolsi
Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach. Comput. Oper. Res. 169: 106719 (2024) - [j21]Kamyla Maria Ferreira
A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Eur. J. Oper. Res. 316(2): 597-616 (2024) - [j20]Yulle G. F. Borges
Algorithms for the bin packing problem with scenarios. J. Comb. Optim. 48(4): 34 (2024) - [j19]Mirko Cavecchia
An Optimization-Based Decision Support System for Multi-trip Vehicle Routing Problems. SN Comput. Sci. 5(2): 225 (2024) - [c15]Ruan Myller Magalhães de Oliveira
A Re-optimization Heuristic for a Dial-a-Ride Problem in the Transportation of Patients. MIC (1) 2024: 145-157 - [c14]Victor Hugo Vidigal Corrêa
Optimizing a Car Patrolling Application by Iterated Local Search. GECCO 2024 - 2023
- [j18]Thiago Alves de Queiroz, Manuel Iori, Arthur Kramer
Dynamic scheduling of patients in emergency departments. Eur. J. Oper. Res. 310(1): 100-116 (2023) - [j17]Beatrice Bolsi
Heuristic algorithms for integrated workforce allocation and scheduling of perishable products. Int. J. Prod. Res. 61(20): 7048-7063 (2023) - [c13]Mirko Cavecchia
A Decision Support System for Multi-Trip Vehicle Routing Problems. ICEIS (1) 2023: 335-343 - [i1]Yulle G. F. Borges, Vinícius Loti de Lima, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Thiago Alves de Queiroz, Rafael C. S. Schouery:
Algorithms for the Bin Packing Problem with Scenarios. CoRR abs/2305.15351 (2023) - 2022
- [j16]Oliviana Xavier do Nascimento
A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Ann. Oper. Res. 316(2): 805-835 (2022) - [j15]Kamyla Maria Ferreira
A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints. Appl. Soft Comput. 118: 108443 (2022) - [j14]Leonardo Junqueira
The static stability of support factor-based rectangular packings: an assessment by regression analysis. Int. Trans. Oper. Res. 29(1): 574-599 (2022) - [c12]Thiago Alves de Queiroz
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS. ICVNS 2022: 97-111 - [c11]Layane Rodrigues de Souza Queiroz
A VNS Based Heuristic for a 2D Open Dimension Problem. ICVNS 2022: 125-136 - 2021
- [j13]Oliviana Xavier do Nascimento, Thiago Alves de Queiroz, Leonardo Junqueira
Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm. Comput. Oper. Res. 128: 105186 (2021) - [j12]Kamyla Maria Ferreira
An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Comput. Oper. Res. 136: 105452 (2021) - [c10]Thiago Alves de Queiroz
A Variable Neighborhood Heuristic for Facility Locations in Fog Computing. ICVNS 2021: 28-42 - [c9]Thiago Alves de Queiroz
Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search. ICVNS 2021: 138-151 - [c8]Beatrice Bolsi
Integrated Workforce Scheduling and Flexible Flow Shop Problem in the Meat Industry. APMS (2) 2021: 594-602 - 2020
- [j11]Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima
Grids for cutting and packing problems: a study in the 2D knapsack problem. 4OR 18(3): 293-339 (2020) - [j10]Thiago Alves de Queiroz
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. Int. Trans. Oper. Res. 27(3): 1478-1500 (2020) - [c7]Thiago Alves de Queiroz, Claudia Canali, Manuel Iori, Riccardo Lancellotti:
A Location-allocation Model for Fog Computing Infrastructures. CLOSER 2020: 253-260
2010 – 2019
- 2019
- [c6]Thiago Alves de Queiroz
Multi-objective Basic Variable Neighborhood Search for Portfolio Selection. ICVNS 2019: 67-80 - 2018
- [j9]Kamyla Maria Ferreira
Two effective simulated annealing algorithms for the Location-Routing Problem. Appl. Soft Comput. 70: 389-422 (2018) - [j8]Leandro Resende Mundim, Thiago Alves de Queiroz
Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem. Electron. Notes Discret. Math. 66: 127-134 (2018) - [c5]Oliviana Xavier do Nascimento, Luciana Vieira de Melo, Thiago Alves de Queiroz:
Exact Method for the Container Loading Problem with Priority and Stability. CLEI 2018: 176-183 - 2017
- [j7]Thiago Alves de Queiroz
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches. Comput. Ind. Eng. 105: 313-328 (2017) - [j6]Leandro Resende Mundim
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81: 358-371 (2017) - 2016
- [j5]Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz
Heuristics for a hub location-routing problem. Networks 68(1): 54-90 (2016) - [c4]Evandro C. Bracht
Dynamic cargo stability in loading and transportation of containers. CASE 2016: 227-232 - 2015
- [j4]Thiago Alves de Queiroz
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR 13(2): 199-219 (2015) - 2014
- [j3]Thiago Alves de Queiroz
Order and static stability into the strip packing problem. Ann. Oper. Res. 223(1): 137-154 (2014) - [c3]Raínne Florisbelo Gonçalves, Thiago Alves de Queiroz
The Knapsack Problem with Three Practical Constraints. ICCS 2014: 2192-2200 - 2013
- [c2]Thiago Alves de Queiroz
Approaches for the 2D 0-1 knapsack problem with conflict graphs. CLEI 2013: 1-8 - 2012
- [j2]Thiago Alves de Queiroz
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Comput. Oper. Res. 39(2): 200-212 (2012) - [j1]Aline M. Del Valle, Thiago Alves de Queiroz
Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape. Expert Syst. Appl. 39(16): 12589-12598 (2012) - [c1]Leandro Resende Mundim, Thiago Alves de Queiroz
A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape. CLEI 2012: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: