Qiaoming Han - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2024

A Stackelberg order execution gameYinhong Dong, Donglei Du, Qiaoming Han, Jianfeng Ren, Dachuan Xu. anor, 336(1-2):571-604, May 2024. [doi]

2019

Strategy-proof mechanisms for obnoxious facility game with bounded service rangeYukun Cheng, Qiaoming Han, Wei Yu 0010, Guochuan Zhang. jco, 37(2):737-755, 2019. [doi]

2018

A Hashing Power Allocation Game in CryptocurrenciesYukun Cheng, Donglei Du, Qiaoming Han. sagt 2018: 226-238 [doi]

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domainQiaoming Han, Donglei Du, Dachuan Xu, Yicheng Xu. jgo, 70(4):859-873, 2018. [doi]

2014

Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order FormulaQiaoming Han, Donglei Du, Luis F. Zuluaga. ior, 62(3):535-542, 2014. [doi]

2013

Obnoxious Facility Game with a Bounded Service RangeYukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang. tamc 2013: 272-281 [doi]

2012

Strong and weak edges of a graph and linkages with the vertex cover problemQiaoming Han, Abraham P. Punnen. DAM, 160(3):197-203, 2012. [doi]

2010

On the Approximability of the Vertex Cover and Related ProblemsQiaoming Han, Abraham P. Punnen. AAIM 2010: 161-169 [doi]

2009

An edge-reduction algorithm for the vertex cover problemQiaoming Han, Abraham P. Punnen, Yinyu Ye. orl, 37(3):181-186, 2009. [doi]

2008

Improved Bounds for the Symmetric Rendezvous Value on the LineQiaoming Han, Donglei Du, Juan Vera, Luis F. Zuluaga. ior, 56(3):772-782, 2008. [doi]

2007

Improved bounds for the symmetric rendezvous value on the lineQiaoming Han, Donglei Du, Juan Vera, Luis F. Zuluaga. soda 2007: 69-78 [doi]

2005

An adaptive conic trust-region method for unconstrained optimizationQiaoming Han, Wenyu Sun, Jiye Han, Raimundo J. B. de Sampaio. oms, 20(6):665-677, 2005. [doi]

2004

Improved approximations for max set splitting and max NAE SATJiawei Zhang, Yinyu Ye, Qiaoming Han. DAM, 142(1-3):133-149, 2004. [doi]

2002

On approximation of max-vertex-coverQiaoming Han, Yinyu Ye, Hantao Zhang, Jiawei Zhang. eor, 143(2):342-355, 2002. [doi]

An improved rounding method and semidefinite programming relaxation for graph partitionQiaoming Han, Yinyu Ye, Jiawei Zhang. mp, 92(3):509-535, 2002. [doi]

2001

Revised filled function methods for global optimizationQiaoming Han, Jiye Han. amc, 119(2-3):217-228, 2001. [doi]

Stability Analysis of Gradient-Based Neural Networks for Optimization ProblemsQiaoming Han, Li-Zhi Liao, Houduo Qi, Liqun Qi. jgo, 19(4):363-381, 2001. [doi]

1998

Projection and contraction methods for semidefinite programmingQiaoming Han. amc, 95(2-3):275-289, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL