default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJintong Ren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Jintong Ren:
Optimization algorithms for graph layout problems. (Algorithmes d'optimisation pour deux problèmes de disposition des graphes). University of Angers, France, 2020
Journal Articles
- 2024
- [j9]Zequn Wei
, Jin-Kao Hao, Jintong Ren, Qinghua Wu, Eduardo Rodriguez-Tello:
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints. Knowl. Based Syst. 302: 112378 (2024) - 2023
- [j8]Wenheng Liu, Mahjoub Dridi, Jintong Ren, Amir Hajjam El Hassani, Shuying Li:
A double-adaptive general variable neighborhood search for an unmanned electric vehicle routing and scheduling problem in green manufacturing systems. Eng. Appl. Artif. Intell. 126(Part D): 107113 (2023) - [j7]Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu:
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. Eur. J. Oper. Res. 304(2): 381-394 (2023) - [j6]Zequn Wei, Jin-Kao Hao, Jintong Ren, Fred W. Glover:
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem. Eur. J. Oper. Res. 309(3): 993-1009 (2023) - [j5]Zhihong Wang, Huayang Dai, Yueguan Yan, Jibo Liu, Jintong Ren:
Combination of InSAR with a Depression Angle Model for 3D Deformation Monitoring in Mining Areas. Remote. Sens. 15(7): 1834 (2023) - [j4]Zhihong Wang, Huayang Dai, Yueguan Yan, Jintong Ren, Yanjun Zhang, Jibo Liu:
An InSAR Deformation Phase Retrieval Method Combined with Reference Phase in Mining Areas. Remote. Sens. 15(18): 4573 (2023) - 2022
- [j3]Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu:
Intensification-driven local search for the traveling repairman problem with profits. Expert Syst. Appl. 202: 117072 (2022) - 2020
- [j2]Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello, Liwen Li, Kun He:
A new iterated local search algorithm for the cyclic bandwidth problem. Knowl. Based Syst. 203: 106136 (2020) - 2019
- [j1]Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello:
An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem. IEEE Access 7: 98436-98452 (2019)
Conference and Workshop Papers
- 2019
- [c1]Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello:
A Study of Recombination Operators for the Cyclic Bandwidth Problem. EA 2019: 177-191
Informal and Other Publications
- 2023
- [i2]Zhang-Hua Fu, Sipeng Sun, Jintong Ren, Tianshu Yu, Haoyu Zhang, Yuanyuan Liu, Lingxiao Huang, Xiang Yan, Pinyan Lu:
A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem. CoRR abs/2308.04639 (2023) - 2021
- [i1]Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu:
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. CoRR abs/2111.05017 (2021)
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: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:
