A note on the complexity of *L* _{ p } minimizationD Ge, X Jiang, Y Ye Mathematical programming 129, 285-299, 2011 | 335 | 2011 |

Complexity of unconstrained minimization X Chen, D Ge, Z Wang, Y Ye Mathematical Programming 143 (1), 371-383, 2014 | 165 | 2014 |

A review of piecewise linearization methods MH Lin, JG Carlsson, D Ge, J Shi, JF Tsai Mathematical problems in Engineering 2013 (1), 101376, 2013 | 153 | 2013 |

Solving min-max multi-depot vehicle routing problem J Carlsson, D Ge, A Subramaniam, A Wu, Y Ye Lectures on global optimization 55, 31-46, 2009 | 126 | 2009 |

The cost of cache-oblivious searching MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ... Algorithmica 61 (2), 463-505, 2011 | 50 | 2011 |

A note on appointment scheduling with piecewise linear cost functions D Ge, G Wan, Z Wang, J Zhang Mathematics of Operations Research 39 (4), 1244-1251, 2014 | 49 | 2014 |

JD. com: Operations research algorithms drive intelligent warehouse robots to work H Qin, J Xiao, D Ge, L Xin, J Gao, S He, H Hu, JG Carlsson INFORMS Journal on Applied Analytics 52 (1), 42-55, 2022 | 41 | 2022 |

Improved bounds on sorting by length-weighted reversals MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan Journal of Computer and System Sciences 74 (5), 744-774, 2008 | 38 | 2008 |

Sorting by length-weighted reversals: Dealing with signs and circularity F Swidan, MA Bender, D Ge, S He, H Hu, RY Pinter Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul …, 2004 | 36 | 2004 |

A genetic algorithm-based method for look-ahead scheduling in the finishing phase of construction projects N Dong, D Ge, M Fischer, Z Haddad Advanced Engineering Informatics 26 (4), 737-748, 2012 | 35 | 2012 |

Improved bounds on sorting with length-weighted reversals. MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan SODA 4, 919-928, 2004 | 34 | 2004 |

A non-asymptotic approach to analyzing kidney exchange graphs Y Ding, D Ge, S He, CT Ryan Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 30 | 2015 |

Bayesian dynamic learning and pricing with strategic customers X Chen, J Gao, D Ge, Z Wang Production and Operations Management 31 (8), 3125-3142, 2022 | 29 | 2022 |

Interior-point methods strike back: Solving the wasserstein barycenter problem D Ge, H Wang, Z Xiong, Y Ye Advances in neural information processing systems NeurIPS'19 32, 2019 | 28 | 2019 |

On equivalence of semidefinite relaxations for quadratic matrix programming Y Ding, D Ge, H Wolkowicz Mathematics of Operations Research 36 (1), 88-104, 2011 | 27 | 2011 |

Improved approximation algorithms for the freeze-tag problem EM Arkin, MA Bender, D Ge Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 27 | 2003 |

Strong np-hardness for sparse optimization with concave penalty functions Y Chen, D Ge, M Wang, Z Wang, Y Ye, H Yin Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017 | 23 | 2017 |

Optimization theory, methods, and applications in engineering 2013 JF Tsai, JG Carlsson, D Ge, H Yi-Chung, J Shi Mathematical problems in engineering 2014, 2014 | 21 | 2014 |

On doubly positive semidefinite programming relaxations D Ge, Y Ye Manuscript, Availabe at http://www. optimizationonline. org/DB HTML/2010/08 …, 2010 | 18* | 2010 |

New developments of ADMM-based interior point methods for linear programming and conic programming Q Deng, Q Feng, W Gao, D Ge, B Jiang, Y Jiang, J Liu, T Liu, C Xue, Y Ye, ... arXiv preprint arXiv:2209.01793, 2022 | 17 | 2022 |