default search action
Túlio A. M. Toffolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]George H. G. Fonseca
, Guilherme B. Figueiroa, Túlio A. M. Toffolo:
A fix-and-optimize heuristic for the Unrelated Parallel Machine Scheduling Problem. Comput. Oper. Res. 163: 106504 (2024) - 2023
- [j26]Júlia Cária de Freitas, Puca Huachi Vaz Penna, Túlio A. M. Toffolo:
Exact and heuristic approaches to Truck-Drone Delivery Problems. EURO J. Transp. Logist. 12: 100094 (2023) - [j25]Toni Pacheco, Rafael Martinelli
Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem. Transp. Sci. 57(2): 463-481 (2023) - 2022
- [j24]Alexandre Colaers Andersen, Konstantin Pavlikov
Weapon-target assignment problem: exact and approximate solution algorithms. Ann. Oper. Res. 312(2): 581-606 (2022) - [j23]Vinícius Gandra Martins Santos
The vessel swap-body routing problem. Eur. J. Oper. Res. 303(1): 354-369 (2022) - [j22]Jonatas B. C. Chagas
The double traveling salesman problem with partial last-in-first-out loading constraints. Int. Trans. Oper. Res. 29(4): 2346-2373 (2022) - [j21]George H. G. Fonseca
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem. J. Sched. 25(3): 273-286 (2022) - 2021
- [j20]Emmanouil Thanos, Túlio A. M. Toffolo
The tactical berth allocation problem with time-variant specific quay crane assignments. Comput. Ind. Eng. 155: 107168 (2021) - [j19]Vinícius Gandra Martins Santos
The impact of loading restrictions on the two-echelon location routing problem. Comput. Ind. Eng. 160: 107609 (2021) - [i3]Júlia Cária de Freitas, Puca Huachi Vaz Penna, Túlio A. M. Toffolo:
Exact and Heuristic Approaches to Drone Delivery Problems. CoRR abs/2108.01996 (2021) - 2020
- [j18]Thomas Van den Bossche
Truck scheduling in tank terminals. EURO J. Transp. Logist. 9(1): 100001 (2020)
2010 – 2019
- 2019
- [j17]Túlio A. M. Toffolo
The sport teams grouping problem. Ann. Oper. Res. 275(1): 223-243 (2019) - [j16]Sam Heshmati
Crane-operated warehouses: Integrating location assignment and crane scheduling. Comput. Ind. Eng. 129: 274-295 (2019) - [j15]Yi-Hang Zhu
Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput. Oper. Res. 104: 98-112 (2019) - [j14]Túlio A. M. Toffolo
Heuristics for vehicle routing problems: Sequence or set optimization? Comput. Oper. Res. 105: 118-131 (2019) - [j13]Everton Fernandes da Silva
Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems. Comput. Oper. Res. 109: 12-27 (2019) - [j12]Haroldo G. Santos
Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem. Int. Trans. Oper. Res. 26(2): 707-724 (2019) - [i2]Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza, Manuel Iori:
The double traveling salesman problem with partial last-in-first-out loading constraints. CoRR abs/1908.08494 (2019) - 2018
- [j11]Túlio A. M. Toffolo
Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89: 68-81 (2018) - [i1]Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters:
Heuristics for vehicle routing problems: Sequence or set optimization? CoRR abs/1803.06062 (2018) - 2017
- [b1]Túlio Ângelo Machado Toffolo:
Decomposition-based algorithms for optimization problems ; Decompositie-algoritmen voor optimalisatieproblemen. Katholieke Universiteit Leuven, Belgium, 2017 - [j10]David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo
Multi-machine energy-aware scheduling. EURO J. Comput. Optim. 5(1-2): 285-307 (2017) - [j9]Rafael A. M. Gomes, Túlio A. M. Toffolo
Variable neighborhood search accelerated column generation for the nurse rostering problem. Electron. Notes Discret. Math. 58: 31-38 (2017) - [j8]Túlio A. M. Toffolo
A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur. J. Oper. Res. 257(2): 526-538 (2017) - 2016
- [j7]George Henrique Godim da Fonseca, Haroldo Gambini Santos
GOAL solver: a hybrid local search based solver for high school timetabling. Ann. Oper. Res. 239(1): 77-97 (2016) - [j6]Haroldo G. Santos
Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239(1): 225-251 (2016) - [j5]Túlio A. M. Toffolo
Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. Eur. J. Oper. Res. 250(3): 737-744 (2016) - [j4]Túlio A. M. Toffolo
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. J. Sched. 19(3): 295-307 (2016) - [c1]Janniele A. S. Araujo
Neighborhood Composition Strategies in Stochastic Local Search. HM 2016: 118-130 - 2012
- [j3]Samuel S. Brito, George H. G. Fonseca, Túlio A. M. Toffolo
A SA-VNS approach for the High School Timetabling Problem. Electron. Notes Discret. Math. 39: 169-176 (2012) - [j2]Eduardo Uchoa
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks 59(1): 148-160 (2012)
2000 – 2009
- 2009
- [j1]Alexandre Xavier Martins, Maurício C. de Souza
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J. Heuristics 15(2): 133-151 (2009)
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-10-07 22:16 CEST 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: