Qiaoming Han

Orcid: 0000-0002-8999-3621

According to our database1, Qiaoming Han authored at least 18 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Stackelberg order execution game.
Ann. Oper. Res., May, 2024

2019
Strategy-proof mechanisms for obnoxious facility game with bounded service range.
J. Comb. Optim., 2019

2018
Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain.
J. Glob. Optim., 2018

A Hashing Power Allocation Game in Cryptocurrencies.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2014
Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula.
Oper. Res., 2014

2013
Obnoxious Facility Game with a Bounded Service Range.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Strong and weak edges of a graph and linkages with the vertex cover problem.
Discret. Appl. Math., 2012

2010
On the Approximability of the Vertex Cover and Related Problems.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett., 2009

2008
Improved Bounds for the Symmetric Rendezvous Value on the Line.
Oper. Res., 2008

2007
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR, 2007

2005
An adaptive conic trust-region method for unconstrained optimization.
Optim. Methods Softw., 2005

2004
Improved approximations for max set splitting and max NAE SAT.
Discret. Appl. Math., 2004

2002
An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program., 2002

On approximation of max-vertex-cover.
Eur. J. Oper. Res., 2002

2001
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems.
J. Glob. Optim., 2001

Revised filled function methods for global optimization.
Appl. Math. Comput., 2001

1998
Projection and contraction methods for semidefinite programming.
Appl. Math. Comput., 1998


  Loading...