Qiaoming Han

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.

[BibT_eX]

[DOI]

Donglei Du

Luis F. Zuluaga

Oper. Res., 2014

2013

Obnoxious Facility Game with a Bounded Service Range.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2010

On the Approximability of the Vertex Cover and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

An edge-reduction algorithm for the vertex cover problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

2008

Improved Bounds for the Symmetric Rendezvous Value on the Line.

[BibT_eX]

[DOI]

Donglei Du

Juan Carlos Vera

Luis Fernando Zuluaga

Oper. Res., 2008

2007

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

[BibT_eX]

[DOI]

CoRR, 2007

2005

An adaptive conic trust-region method for unconstrained optimization.

[BibT_eX]

[DOI]

Raimundo J. B. de Sampaio

Wenyu Sun

Jiye Han

Optim. Methods Softw., 2005

2004

Improved approximations for max set splitting and max NAE SAT.

[BibT_eX]

[DOI]

Jiawei Zhang

Discret. Appl. Math., 2004

2002

An improved rounding method and semidefinite programming relaxation for graph partition.

[BibT_eX]

[DOI]

Jiawei Zhang

Math. Program., 2002

On approximation of max-vertex-cover.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

2001

Stability Analysis of Gradient-Based Neural Networks for Optimization Problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

Revised filled function methods for global optimization.

[BibT_eX]

[DOI]

Jiye Han

Appl. Math. Comput., 2001

1998

Projection and contraction methods for semidefinite programming.

[BibT_eX]

[DOI]