default search action
Xiucui Guan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]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) - [j22]Xinqiang Qian, Xiucui Guan
Inverse Vertex/Absolute Quickest 1-Center Location Problem on a Tree Under Weighted l1 Norm. J. Optim. Theory Appl. 200(2): 524-554 (2024) - 2023
- [j21]Junhua Jia
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) - [j20]Xinqiang Qian, Xiucui Guan
Vertex quickest 1-center location problem on trees and its inverse problem under weighted l∞ norm. J. Glob. Optim. 85(2): 461-485 (2023) - [j19]Qiao Zhang, Xiucui Guan
The restricted inverse optimal value problem on shortest path under l1 norm on trees. J. Glob. Optim. 86(1): 251-284 (2023) - 2022
- [j18]Qiao Zhang, Xiucui Guan
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees. J. Comb. Optim. 44(1): 74-93 (2022) - [j17]Junhua Jia, Xiucui Guan
Inverse max+sum spanning tree problem under weighted l∞ norm by modifying max-weight vector. J. Glob. Optim. 84(3): 715-738 (2022) - 2021
- [j16]Xiucui Guan, Chao Liu, Qiao Zhang:
The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees. Asia Pac. J. Oper. Res. 38(1): 2050041:1-2050041:27 (2021) - [j15]Jian Li, Liyan Jia, Tingting Li, Xiucui Guan, Haoxiang Wang, Dong Lu, Hao Sun
Scheduled service network design of long-haul freight transportation based on the segment subcontract. Comput. Ind. Eng. 157: 107253 (2021) - [j14]Hui Wang, Xiucui Guan
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. J. Comb. Optim. 41(4): 861-887 (2021) - [j13]Binwu Zhang, Xiucui Guan
The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm. J. Glob. Optim. 79(3): 757-777 (2021) - [j12]Qiao Zhang, Xiucui Guan
Maximum shortest path interdiction problem by upgrading edges on trees under weighted l1 norm. J. Glob. Optim. 79(4): 959-987 (2021) - [j11]Qiao Zhang, Xiucui Guan
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance. Optim. Lett. 15(8): 2661-2680 (2021) - 2020
- [j10]Binwu Zhang, Xiucui Guan
Inverse optimal value problem on minimum spanning tree under unit l∞ norm. Optim. Lett. 14(8): 2301-2322 (2020)
2010 – 2019
- 2018
- [j9]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) - [j8]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
- [j7]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) - 2015
- [j6]Xiucui Guan, Panos M. Pardalos, Xia Zuo:
Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l∞ Norm. J. Glob. Optim. 61(1): 165-182 (2015) - 2013
- [j5]Bingwu Zhang, Xiucui Guan
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance. J. Appl. Math. 2013: 847317:1-847317:8 (2013) - 2012
- [j4]Xiucui Guan, Binwu Zhang:
Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1): 75-82 (2012) - 2010
- [c6]Xiucui Guan, Binwu Zhang:
Inverse 1-median Problem on Trees under Weighted l∞ Norm. AAIM 2010: 150-160
2000 – 2009
- 2009
- [c5]Yangbo Cao, Xiucui Guan:
A Class of Constrained Inverse Bottleneck Optimization Problems under Weighted Hamming Distance. CSO (2) 2009: 859-863 - 2007
- [j3]Xiucui Guan, Jianzhong Zhang:
Inverse constrained bottleneck problems under weighted linfinity norm. Comput. Oper. Res. 34(11): 3243-3254 (2007) - [j2]Xiucui Guan, Jianzhong Zhang:
Improving multicut in directed trees by upgrading nodes. Eur. J. Oper. Res. 183(3): 971-980 (2007) - 2006
- [j1]Xiucui Guan, Jianzhong Zhang:
A class of node based bottleneck improvement problems. Eur. J. Oper. Res. 174(3): 1540-1552 (2006) - [c4]Xiucui Guan, Jianzhong Zhang:
Inverse Bottleneck Optimization Problems on Networks. AAIM 2006: 220-230 - [c3]Xiucui Guan, Jie Su:
Further Research on Node Based Bottleneck Improvement Problem for Multicut. ICIC (1) 2006: 895-900 - [c2]Jie Su, Xiucui Guan:
Multi-objective Optimal Strategy for Individual Consumption-Investment with Fuzzy Coefficients. ICIC (1) 2006: 919-924 - 2005
- [c1]Xiucui Guan, Jianzhong Zhang:
Inverse Constrained Bottleneck Problems on Networks. ICCSA (4) 2005: 161-171
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:23 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: