×

zbMATH — the first resource for mathematics

Gao, Linchun

Compute Distance To:
Author ID: gao.linchun Recent zbMATH articles by "Gao, Linchun"
Published as: Gao, L.; Gao, Linchun
Documents Indexed: 9 Publications since 1982

Co-Authors

0 single-authored
2 Prékopa, András

Publications by Year

Citations contained in zbMATH

6 Publications have been cited 42 times in 39 Documents Cited by Year
Nonmonotone line search algorithm for constrained minimax problems. Zbl 1039.90089
Yu, Y. H.; Gao, L.
23
2002
Bounding the probability of the union of events by aggregation and disaggregation in linear programs. Zbl 1107.60005
Prékopa, András; Gao, Linchun
12
2005
Lower and upper bounds for the probability that at least \(r\) and exactly \(r\) out of \(n\) events occur. Zbl 1002.60017
Gao, Linchun; Prékopa, András
4
2002
Applications of MLPG method in dynamic fracture problems. Zbl 1232.74086
Gao, L.; Liu, K.; Liu, Y.
1
2006
An adaptive social network-inspired approach to resource discovery for the complex grid systems. Zbl 1140.93438
Gao, L.; Ding, Y.; Ying, H.
1
2006
Time-dependent cooperation in games. Zbl 0677.90101
Gao, L.; Jakubowski, A.; Klompstra, M. B.; Olsder, G. J.
1
1989
Applications of MLPG method in dynamic fracture problems. Zbl 1232.74086
Gao, L.; Liu, K.; Liu, Y.
1
2006
An adaptive social network-inspired approach to resource discovery for the complex grid systems. Zbl 1140.93438
Gao, L.; Ding, Y.; Ying, H.
1
2006
Bounding the probability of the union of events by aggregation and disaggregation in linear programs. Zbl 1107.60005
Prékopa, András; Gao, Linchun
12
2005
Nonmonotone line search algorithm for constrained minimax problems. Zbl 1039.90089
Yu, Y. H.; Gao, L.
23
2002
Lower and upper bounds for the probability that at least \(r\) and exactly \(r\) out of \(n\) events occur. Zbl 1002.60017
Gao, Linchun; Prékopa, András
4
2002
Time-dependent cooperation in games. Zbl 0677.90101
Gao, L.; Jakubowski, A.; Klompstra, M. B.; Olsder, G. J.
1
1989

Citations by Year