default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinwu Zhang
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Junhua Jia, Xiucui Guan
, Binwu Zhang, Xinqiang Qian, Panos M. Pardalos:
Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted l1 norm. J. Comput. Appl. Math. 451: 116110 (2024)- 2023
- [j14]Junhua Jia, Xiucui Guan, Hui Wang, Binwu Zhang, Panos M. Pardalos:
Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l∞ norm. J. Comput. Appl. Math. 419: 114754 (2023) - 2021
- [j13]Hui Wang, Xiucui Guan, Qiao Zhang, Binwu Zhang:
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. J. Comb. Optim. 41(4): 861-887 (2021) - [j12]Binwu Zhang, Xiucui Guan, Panos M. Pardalos, Hui Wang, Qiao Zhang, Yan Liu, Shuyi Chen:
The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm. J. Glob. Optim. 79(3): 757-777 (2021) - 2020
- [j11]Binwu Zhang, Xiucui Guan, Qiao Zhang:
Inverse optimal value problem on minimum spanning tree under unit l∞ norm. Optim. Lett. 14(8): 2301-2322 (2020)
2010 – 2019
- 2018
- [j10]Binwu Zhang, Xiucui Guan, Panos M. Pardalos, Chunyuan He:
An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance. J. Optim. Theory Appl. 178(2): 538-559 (2018) - [j9]Xiucui Guan, Panos M. Pardalos, Binwu Zhang:
Inverse max+sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector. Optim. Lett. 12(5): 1065-1077 (2018) - 2017
- [j8]Xiucui Guan, Xinyan He, Panos M. Pardalos, Binwu Zhang:
Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector. J. Glob. Optim. 69(4): 911-925 (2017) - 2012
- [j7]Xiucui Guan, Binwu Zhang:
Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1): 75-82 (2012) - 2011
- [j6]Binwu Zhang, Shu-Cherng Fang:
A selfish routing based network improvement problem. J. Syst. Sci. Complex. 24(1): 68-78 (2011) - 2010
- [c1]Xiucui Guan, Binwu Zhang:
Inverse 1-median Problem on Trees under Weighted l∞ Norm. AAIM 2010: 150-160
2000 – 2009
- 2006
- [j5]Binwu Zhang, Jianzhong Zhang, Liqun Qi:
The shortest path improvement problems under Hamming distance. J. Comb. Optim. 12(4): 351-361 (2006) - [j4]Binwu Zhang, Jianzhong Zhang, Yong He:
Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance. J. Glob. Optim. 34(3): 467-474 (2006) - 2005
- [j3]Yong He, Binwu Zhang, Enyu Yao:
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. J. Comb. Optim. 9(1): 91-100 (2005) - [j2]Binwu Zhang, Jianzhong Zhang, Yong He:
The Center Location Improvement Problem Under the Hamming Distance. J. Comb. Optim. 9(2): 187-198 (2005) - [j1]Frank K. Hwang, Binwu Zhang:
Strict nonblockingness of reduced shuffle-exchange networks. Networks 45(1): 4-8 (2005)
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-08-23 18:31 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:
