Search Results - person:"Lin, Geng"

How do CSR and perceived ethics enhance corporate reputation and product innovativeness?

Geng, Lin; Cui, Xiaozhong; Nazir, Rabia; Nguyen Binh An - In: Economic research 35 (2022) 1,5, pp. 5131-5149

Persistent link: https://www.econbiz.de/10014414125

Tailoring Microstructure And Properties of Ultra-Fine Grained Mg-Al-Ca-Mn Alloy Wires by Grain Boundary Segregation

Zuo, J.; Nakata, T.; Xu, Chao; Xia, Y.P; SHI, Hailong; … - 2022

An extraordinary high-strength dilute Mg-0.8Al-0.1Ca-0.6Mn (wt. %) alloy wire was successfully developed by hot drawing, which exhibits high tensile yield strength of 394 MPa, ultimate tensile strength of 431 MPa and moderate elongation to failure of 6.0%. The high strength was mainly attributed...

Persistent link: https://www.econbiz.de/10013302425

A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem

Guan, Jian; Lin, Geng; Feng, Hui-Bin - In: Computers & operations research : and their … 98 (2018), pp. 1-12

Persistent link: https://www.econbiz.de/10011886706

Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem

Guan, Jian; Lin, Geng - In: European journal of operational research : EJOR 249 (2016) 3, pp. 899-909

Persistent link: https://www.econbiz.de/10011412474

Max-k-cut by the discrete dynamic convexized method

Zhu, Wenxing; Lin, Geng; Ali, M. Masoom - In: INFORMS journal on computing : JOC 25 (2013) 1, pp. 27-40

Persistent link: https://www.econbiz.de/10009728364

A discrete dynamic convexized method for the max-cut problem

Lin, Geng; Zhu, Wenxing - 2012

Persistent link: https://www.econbiz.de/10009581383

A dynamic convexized method for nonconvex mixed integer nonlinear programming

Zhu, Wenxing; Lin, Geng - In: Computers & operations research : and their … 38 (2011) 12, pp. 1792-1804

Persistent link: https://www.econbiz.de/10009155323

Max-k-Cut by the Discrete Dynamic Convexized Method

Zhu, Wenxing; Lin, Geng; Ali, M. M. - In: INFORMS journal on computing : JOC 25 (2013) 1, pp. 27-40

Persistent link: https://www.econbiz.de/10010082478

A discrete dynamic convexized method for the max-cut problem

Lin, Geng; Zhu, Wenxing - 2012

Persistent link: https://www.econbiz.de/10009987921

An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable

Lin, Geng; Zhu, Wenxing; Ali, M. - In: Journal of Global Optimization 50 (2011) 4, pp. 657-673

Persistent link: https://www.econbiz.de/10009324645