| 查看: 1396 | 回复: 4 | ||
[求助]
金币求以下文章是否被SCI检索及检索信息（检索号等），谢谢！
|
|
【1】题名：A new global optimization algorithm for solving generalized geometric programming 杂志名：Mathematical Problems in Engineering 【2】题名：A new linearization method for generalized linear multiplicative programming 杂志名：Computers and Operations Research |
回复此楼» 猜你喜欢
职称评审没过，求安慰
已经有56人回复
-
最近几年招的学生写论文不引自己组发的文章
已经有5人回复
-
26申博自荐
已经有3人回复
-
A期刊撤稿
已经有4人回复
帮顶11 
2楼2011-03-25 18:36:02
★
小木虫(金币+0.2):抢了个小板凳，给个红包
小木虫(金币+0.2):抢了个小板凳，给个红包
| 顶一下 |
3楼2011-03-25 18:47:00
hezhao311
至尊木虫 (著名写手)
- LS-EPI: 12
- 应助: 9 (幼儿园)
- 贵宾: 0.027
- 金币: 24369.4
- 红花: 14
- 沙发: 2
- 帖子: 2513
- 在线: 313.3小时
- 虫号: 819621
- 注册: 2009-07-31
- 性别: GG
- 专业: 作物种质资源与遗传育种学
wcfzyh(金币+5): 2011-03-26 11:50:02
|
SCI收录1篇 FN ISI Export Format VR 1.0 PT J AU Wang, CF Liu, SY AF Wang, Chun-Feng Liu, San-Yang TI A new linearization method for generalized linear multiplicative programming SO COMPUTERS & OPERATIONS RESEARCH LA English DT Article DE Global optimization; Multiplicative programming; Linear relaxation; Branch and bound ID GLOBAL OPTIMIZATION; ALGORITHM; EXPONENT AB This paper presents a deterministic global optimization algorithm for solving generalized linear multiplicative programming (GLMP). In this algorithm, a new linearization method is proposed, which applies more information of the function of (GLMP) than some other methods. By using this new linearization technique, the initial nonconvex problem is reduced to a sequence of linear programming problems. A deleting rule is presented to improve the convergence speed of this algorithm. The convergence of this algorithm is established, and some experiments are reported to show the feasibility and efficiency of this algorithm. (C) 2010 Elsevier Ltd. All rights reserved. C1 [Wang, Chun-Feng; Liu, San-Yang] Xidian Univ, Dept Math Sci, Xian 710071, Peoples R China. RP Wang, CF, Xidian Univ, Dept Math Sci, Xian 710071, Peoples R China. EM wangchunfeng09@126.com FU National Natural Science Foundation of China [60974082]; Fundamental Research Funds for the Central Universities [K50510700004] FX This paper is supported by the National Natural Science Foundation of China (60974082), and the Fundamental Research Funds for the Central Universities (K50510700004). NR 28 TC 0 PU PERGAMON-ELSEVIER SCIENCE LTD PI OXFORD PA THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND SN 0305-0548 J9 COMPUT OPER RES JI Comput. Oper. Res. PD JUL PY 2011 VL 38 IS 7 BP 1008 EP 1013 DI 10.1016/j.cor.2010.10.016 PG 6 SC Computer Science, Interdisciplinary Applications; Engineering, Industrial; Operations Research & Management Science GA 702OD UT ISI:000285903100003 ER -------------------------------------------------------------------------------- EF |
4楼2011-03-26 10:55:32
5楼2012-01-10 17:30:53