default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonatas B. C. Chagas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Jonatas B. C. Chagas, Markus Wagner:
A weighted-sum method for solving the bi-objective traveling thief problem. Comput. Oper. Res. 138: 105560 (2022)- [j5]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. Int. Trans. Oper. Res. 29(4): 2346-2373 (2022) - [j4]Jonatas B. C. Chagas, Markus Wagner:
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. Optim. Lett. 16(8): 2313-2331 (2022) - 2021
- [j3]Jonatas B. C. Chagas, Julian Blank, Markus Wagner, Marcone J. F. Souza, Kalyanmoy Deb:
A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. J. Heuristics 27(3): 267-301 (2021) - [i5]Jonatas B. C. Chagas, Markus Wagner:
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. CoRR abs/2109.13103 (2021) - 2020
- [j2]Jonatas B. C. Chagas, Ulisses Eduardo Ferreira da Silveira, André G. Santos, Marcone J. F. Souza:
A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks. Int. Trans. Oper. Res. 27(1): 112-137 (2020) - [j1]Jonatas B. C. Chagas, Markus Wagner:
Ants can orienteer a thief in their robbery. Oper. Res. Lett. 48(6): 708-714 (2020) - [i4]Jonatas B. C. Chagas, Julian Blank, Markus Wagner, Marcone J. F. Souza, Kalyanmoy Deb:
A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem. CoRR abs/2002.04303 (2020) - [i3]Jonatas B. C. Chagas, Markus Wagner:
Ants can orienteer a thief in their robbery. CoRR abs/2004.07017 (2020) - [i2]Jonatas B. C. Chagas, Markus Wagner:
A weighted-sum method for solving the bi-objective traveling thief problem. CoRR abs/2011.05081 (2020)
2010 – 2019
- 2019
- [c9]André Luyde S. Souza, Jonatas B. C. Chagas, Puca Huachi Vaz Penna, Marcone J. F. Souza:
A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem. ICVNS 2019: 53-66 - [i1]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
- [c8]André G. Santos, Jonatas B. C. Chagas:
The Thief Orienteering Problem: Formulation and Heuristic Approaches. CEC 2018: 1-9 - [c7]Roberto D. Aquino, Jonatas B. C. Chagas, Marcone J. F. Souza:
A Variable Neighborhood Search Algorithm for the Long-term Preventive Maintenance Scheduling Problem. ICEIS (1) 2018: 303-310 - [c6]André L. S. Souza, Jonatas B. C. Chagas, Puca Huachi Vaz Penna, Marcone J. F. Souza:
A Late Acceptance Hill-Climbing Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. ISDA (1) 2018: 761-771 - 2017
- [c5]Roberto D. Aquino, Jonatas B. C. Chagas, Marcone J. F. Souza:
A Mixed-Integer Linear Programming Model and a Simulated Annealing Algorithm for the Long-Term Preventive Maintenance Scheduling Problem. ISDA 2017: 144-153 - [c4]Jonatas B. C. Chagas, André G. Santos, Marcone J. F. Souza:
A Memetic Algorithm for the Network Construction Problem with Due Dates. ISDA 2017: 209-220 - [c3]Jonatas B. C. Chagas, André G. Santos:
An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand. ISDA 2017: 785-796 - 2016
- [c2]Jonatas B. C. Chagas, André G. Santos:
A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. ISDA 2016: 921-934 - [c1]Jonatas B. C. Chagas, Ulisses Eduardo Ferreira da Silveira, Marcelo Pinheiro Leite Benedito, André G. Santos:
Simulated annealing metaheuristic for the Double Vehicle Routing Problem with Multiple Stacks. ITSC 2016: 1311-1316
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 2025-04-03 00:22 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:
