The following pages link to Qiaoming Han (Q200425):
Displaying 25 items.
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Projection and contraction methods for semidefinite programming (Q1294175) (← links)
- A hashing power allocation game in cryptocurrencies (Q1617668) (← links)
- Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain (Q1753138) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- An improved rounding method and semidefinite programming relaxation for graph partition (Q1849503) (← links)
- Revised filled function methods for global optimization. (Q1854956) (← links)
- A globally convergent trust region algorithm for optimization with general constraints and simple bounds. (Q1864225) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Strategy-proof mechanisms for obnoxious facility game with bounded service range (Q2420664) (← links)
- (Q2934584) (← links)
- Technical Note—A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula (Q2935298) (← links)
- An adaptive conic trust-region method for unconstrained optimization (Q3369518) (← links)
- Improved Bounds for the Symmetric Rendezvous Value on the Line (Q3392207) (← links)
- On the Approximability of the Vertex Cover and Related Problems (Q3578370) (← links)
- (Q4399581) (← links)
- (Q4528351) (← links)
- (Q4838777) (← links)
- (Q4880941) (← links)
- Obnoxious Facility Game with a Bounded Service Range (Q4922134) (← links)
- An Overview of Submodular Optimization: Single- and Multi-Objectives (Q5864847) (← links)
- Stability analysis of gradient-based neural networks for optimization problems (Q5942314) (← links)
- A predict-correct projection method for monotone variant variational inequalities (Q5955917) (← links)
- A Stackelberg order execution game (Q6549606) (← links)
