default search action
Qiaoming Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Yinhong Dong, Donglei Du
, Qiaoming Han, Jianfeng Ren, Dachuan Xu
A Stackelberg order execution game. Ann. Oper. Res. 336(1-2): 571-604 (2024)
2010 – 2019
- 2019
- [j13]Yukun Cheng, Qiaoming Han
Strategy-proof mechanisms for obnoxious facility game with bounded service range. J. Comb. Optim. 37(2): 737-755 (2019) - 2018
- [j12]Qiaoming Han, Donglei Du
Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain. J. Glob. Optim. 70(4): 859-873 (2018) - [c4]Yukun Cheng, Donglei Du
A Hashing Power Allocation Game in Cryptocurrencies. SAGT 2018: 226-238 - 2014
- [j11]Qiaoming Han, Donglei Du
Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula. Oper. Res. 62(3): 535-542 (2014) - 2013
- [c3]Yukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang
Obnoxious Facility Game with a Bounded Service Range. TAMC 2013: 272-281 - 2012
- [j10]Qiaoming Han, Abraham P. Punnen:
Strong and weak edges of a graph and linkages with the vertex cover problem. Discret. Appl. Math. 160(3): 197-203 (2012) - 2010
- [c2]Qiaoming Han, Abraham P. Punnen:
On the Approximability of the Vertex Cover and Related Problems. AAIM 2010: 161-169
2000 – 2009
- 2009
- [j9]Qiaoming Han, Abraham P. Punnen, Yinyu Ye:
An edge-reduction algorithm for the vertex cover problem. Oper. Res. Lett. 37(3): 181-186 (2009) - 2008
- [j8]Qiaoming Han, Donglei Du
Improved Bounds for the Symmetric Rendezvous Value on the Line. Oper. Res. 56(3): 772-782 (2008) - 2007
- [c1]Qiaoming Han, Donglei Du, Juan Carlos Vera, Luis Fernando Zuluaga:
Improved bounds for the symmetric rendezvous value on the line. SODA 2007: 69-78 - [i2]Qiaoming Han, Abraham P. Punnen:
On the approximability of the vertex cover and related problems. CoRR abs/0712.3333 (2007) - [i1]Qiaoming Han, Abraham P. Punnen, Yinyu Ye:
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs. CoRR abs/0712.3335 (2007) - 2005
- [j7]Qiaoming Han, Wenyu Sun, Jiye Han, Raimundo J. B. de Sampaio:
An adaptive conic trust-region method for unconstrained optimization. Optim. Methods Softw. 20(6): 665-677 (2005) - 2004
- [j6]Jiawei Zhang, Yinyu Ye, Qiaoming Han:
Improved approximations for max set splitting and max NAE SAT. Discret. Appl. Math. 142(1-3): 133-149 (2004) - 2002
- [j5]Qiaoming Han, Yinyu Ye, Hantao Zhang, Jiawei Zhang:
On approximation of max-vertex-cover. Eur. J. Oper. Res. 143(2): 342-355 (2002) - [j4]Qiaoming Han, Yinyu Ye, Jiawei Zhang:
An improved rounding method and semidefinite programming relaxation for graph partition. Math. Program. 92(3): 509-535 (2002) - 2001
- [j3]Qiaoming Han, Jiye Han:
Revised filled function methods for global optimization. Appl. Math. Comput. 119(2-3): 217-228 (2001) - [j2]Qiaoming Han, Li-Zhi Liao
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems. J. Glob. Optim. 19(4): 363-381 (2001)
1990 – 1999
- 1998
- [j1]Qiaoming Han:
Projection and contraction methods for semidefinite programming. Appl. Math. Comput. 95(2-3): 275-289 (1998)
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-07-08 21:28 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: