default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXingyin Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Luca Bertazzi
, Xingyin Wang:
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. Networks 80(4): 482-501 (2022)- 2021
- [j13]Debdatta Sinha Roy, Bruce L. Golden, Xingyin Wang, Edward A. Wasil:
Estimating the Tour Length for the Close Enough Traveling Salesman Problem. Algorithms 14(4): 123 (2021) - [j12]Xingyin Wang, Edward A. Wasil:
On the road to better routes: Five decades of published research on the vehicle routing problem. Networks 77(1): 66-87 (2021) - [d1]Debdatta Sinha Roy, Bruce L. Golden, Xingyin Wang, Edward A. Wasil:
Instances for the Close Enough Traveling Salesman Problem. Zenodo, 2021
2010 – 2019
- 2019
- [j11]Xingyin Wang, Bruce L. Golden, Edward A. Wasil:
A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem. Comput. Oper. Res. 101: 200-219 (2019) - [j10]Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
The Bin Packing Problem with Item Fragmentation: A worst-case analysis. Discret. Appl. Math. 261: 63-77 (2019) - [j9]Carmine Cerrone, Benjamin Dussault, Xingyin Wang, Bruce L. Golden, Edward A. Wasil:
A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties. Eur. J. Oper. Res. 272(2): 754-765 (2019) - [j8]Junhua Liu, Yuping Wang, Xingyin Wang, Si Guo, Xin Sui:
A New Dominance Method Based on Expanding Dominated Area for Many-Objective Optimization. Int. J. Pattern Recognit. Artif. Intell. 33(3): 1959008:1-1959008:24 (2019) - 2018
- [c2]Xingyin Wang, Yuping Wang, Junhua Liu, Si Guo, Liwen Liu:
Two-Archive Based Evolutionary Algorithm Using Adaptive Reference Direction and Decomposition for Many-Objective Optimization. CIS 2018: 20-24 - 2017
- [j7]Ping Chen, Bruce L. Golden, Xingyin Wang, Edward A. Wasil:
A novel approach to solve the split delivery vehicle routing problem. Int. Trans. Oper. Res. 24(1-2): 27-41 (2017) - [j6]Stefan Poikonen, Xingyin Wang, Bruce L. Golden:
The vehicle routing problem with drones: Extended models and connections. Networks 70(1): 34-43 (2017) - [j5]Xingyin Wang, Stefan Poikonen, Bruce L. Golden:
The vehicle routing problem with drones: several worst-case results. Optim. Lett. 11(4): 679-697 (2017) - [c1]Junhua Liu, Yuping Wang, Xingyin Wang, Xin Sui, Si Guo, Liwen Liu:
An alpha-Dominance Expandation Based Algorithm for Many-Objective Optimization. CIS 2017: 6-10 - 2016
- [b1]Xingyin Wang:
Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results. University of Maryland, College Park, MD, USA, 2016 - [j4]Xingyin Wang, Bruce L. Golden, Edward A. Wasil, Rui Zhang:
The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement. Comput. Oper. Res. 71: 110-126 (2016) - 2015
- [j3]Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis. Eur. J. Oper. Res. 240(2): 372-381 (2015) - [j2]Xingyin Wang, Bruce L. Golden, Edward A. Wasil:
The min-max multi-depot vehicle routing problem: heuristics and computational results. J. Oper. Res. Soc. 66(9): 1430-1441 (2015) - 2014
- [j1]Xingyin Wang, Bruce L. Golden, Damon Gulczynski:
A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optim. Lett. 8(8): 2349-2356 (2014)
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 21:25 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:
