Projection and contraction methods for semidefinite programming. - Qiaoming Han (Appl. Math. Comput., 1998)

Revised filled function methods for global optimization. - Qiaoming Han; Jiye Han (Appl. Math. Comput., 2001)

Stability Analysis of Gradient-Based Neural Networks for Optimization Problems. - Qiaoming Han; Li-Zhi Liao; Houduo Qi; Liqun Qi 001 (J. Glob. Optim., 2001)

On approximation of max-vertex-cover. - Qiaoming Han; Yinyu Ye 001; Hantao Zhang 001; Jiawei Zhang 006 (Eur. J. Oper. Res., 2002)

An improved rounding method and semidefinite programming relaxation for graph partition. - Qiaoming Han; Yinyu Ye 001; Jiawei Zhang 006 (Math. Program., 2002)

Improved approximations for max set splitting and max NAE SAT. - Jiawei Zhang 006; Yinyu Ye 001; Qiaoming Han (Discret. Appl. Math., 2004)

An adaptive conic trust-region method for unconstrained optimization. - Qiaoming Han; Wenyu Sun; Jiye Han; Raimundo J. B. de Sampaio (Optim. Methods Softw., 2005)

A polynomial time $ frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs - Qiaoming Han; Abraham P. Punnen; Yinyu Ye 001 (CoRR, 2007)

Improved Bounds for the Symmetric Rendezvous Value on the Line. - Qiaoming Han; Donglei Du; Juan Carlos Vera 001; Luis Fernando Zuluaga (Oper. Res., 2008)

An edge-reduction algorithm for the vertex cover problem. - Qiaoming Han; Abraham P. Punnen; Yinyu Ye 001 (Oper. Res. Lett., 2009)

On the Approximability of the Vertex Cover and Related Problems. - Qiaoming Han; Abraham P. Punnen (AAIM, 2010)

Strong and weak edges of a graph and linkages with the vertex cover problem. - Qiaoming Han; Abraham P. Punnen (Discret. Appl. Math., 2012)

Obnoxious Facility Game with a Bounded Service Range. - Yukun Cheng; Qiaoming Han; Wei Yu 010; Guochuan Zhang (TAMC, 2013)

Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula. - Qiaoming Han; Donglei Du; Luis F. Zuluaga (Oper. Res., 2014)

A Hashing Power Allocation Game in Cryptocurrencies. - Yukun Cheng; Donglei Du; Qiaoming Han (SAGT, 2018)

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain. - Qiaoming Han; Donglei Du; Dachuan Xu; Yicheng Xu (J. Glob. Optim., 2018)

Strategy-proof mechanisms for obnoxious facility game with bounded service range. - Yukun Cheng; Qiaoming Han; Wei Yu 010; Guochuan Zhang (J. Comb. Optim., 2019)

A Stackelberg order execution game. - Yinhong Dong; Donglei Du; Qiaoming Han; Jianfeng Ren; Dachuan Xu (Ann. Oper. Res., 2024)