Absorption in model-based search algorithms for combinatorial optimization. - Zijun Wu 001; Michael Kolonko (IEEE Congress on Evolutionary Computation, 2014)

Asymptotic Properties of a Generalized Cross-Entropy Optimization Algorithm. - Zijun Wu 001; Michael Kolonko (IEEE Trans. Evol. Comput., 2014)

An efficient learning method for RBF Neural Networks. - Maryam Pazouki; Zijun Wu 001; Zhixing Yang; Dietmar P. F. Möller (IJCNN, 2015)

Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation. - Michael Kolonko; Zijun Wu 001; Feng Gu 007 (CoRR, 2016)

Selfishness need not be bad. - Zijun Wu 001; Rolf H. Möhring; Yanyan Chen (CoRR, 2017)

Stochastic Runtime Analysis of the Cross-Entropy Algorithm. - Zijun Wu 001; Michael Kolonko; Rolf H. Möhring (IEEE Trans. Evol. Comput., 2017)

Difficult features of combinatorial optimization problems and the tunable w-model benchmark problem for simulating them. - Thomas Weise 001; Zijun Wu 001 (GECCO (Companion), 2018)

Selfishness need not be bad: a general proof. - Zijun Wu 001; Rolf H. Möhring; Dachuan Xu (CoRR, 2018)

An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. - Thomas Weise 001; Zijun Wu 001; Markus Wagner 007 (CoRR, 2018)

Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems. - Zijun Wu 001; Rolf H. Möhring; Jianhui Lai (Theor. Comput. Sci., 2018)

An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search. - Thomas Weise 001; Zijun Wu 001; Markus Wagner 007 (AAAI, 2019)

Improving the statistical quality of random number generators by applying a simple ratio transformation. - Michael Kolonko; Feng Gu 007; Zijun Wu 001 (Math. Comput. Simul., 2019)

A sensitivity analysis for the price of anarchy in non-atomic congestion games. - Zijun Wu 001; Rolf H. Möhring (CoRR, 2020)

A Game-Theoretic Analysis of Deep Neural Networks. - Chunying Ren; Zijun Wu 001; Dachuan Xu; Wenqing Xu (AAIM, 2021)

Selfishness Need Not Be Bad. - Zijun Wu 001; Rolf H. Möhring; Yanyan Chen; Dachuan Xu (Oper. Res., 2021)

ρ/(1-ε)-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes. - Chunying Ren; Zijun Wu 001; Dachuan Xu; Xiaoguang Yang (CoRR, 2022)

A game-theoretic perspective of deep neural networks. - Chunying Ren; Zijun Wu 001; Dachuan Xu; Wenqing Xu (Theor. Comput. Sci., 2023)

A convergence analysis of the price of anarchy in atomic congestion games. - Zijun Wu 001; Rolf H. Möhring; Chunying Ren; Dachuan Xu (Math. Program., 2023)

A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games. - Zijun Wu 001; Rolf H. Möhring (Math. Oper. Res., 2023)

Computing Approximate Mixed Nash Equilibria for Symmetric Weighted Congestion Games. - Chunying Ren; Zijun Wu 001; Xiaoguang Yang; Guoqing Zhang (COCOA (2), 2024)