1007-6093
2010 Issue 3
Rule of Fictitious Play in the Learning Process with Incomplete Learning Times
Ding Zhanwen;Cai Chaoying;Yang Honglin;Jiang Shumin
Ding Zhanwen;Cai Chaoying;Yang Honglin;Jiang Shumin
..............page:91-100
..............page:41-47
The L(3,2,1)-Labeling on Chordal Graphs
Yuan Wanlian;Zhai Mingqing
Yuan Wanlian;Zhai Mingqing
..............page:48-54
Simulated Annealing Algorithm for Vehicle Routing Problem with Time Window under Time-Dependent
Yang Shanlin;Ma Huawei;Gu Tiejun
Yang Shanlin;Ma Huawei;Gu Tiejun
..............page:83-90
Projected Self-Scaling Symmetric Rank One Quasi Newton Methods for Nonlinear Monotone Equations
Liu Hao;Qian Xiaoyan;Ni Qin
Liu Hao;Qian Xiaoyan;Ni Qin
..............page:64-72
The Elimination Cutwidth Problem for Graphs
Zhang Zhenkun;Gao Fengxin
Zhang Zhenkun;Gao Fengxin
..............page:31-40
Extended AS-GN Hybrid Conjugate Gradient Method
Yan Hui;Chen Lanping
Yan Hui;Chen Lanping
..............page:122-128
Online Scheduling with Reassignment under Non-Simultaneous Machine Available Times
Hou Liying;Kang Liying
Hou Liying;Kang Liying
..............page:19-30
A New Vehicle Routing Problem and It\'s Two Stage Algorithm
Wang Kefeng;Ye Chunming;Tang Guochun
Wang Kefeng;Ye Chunming;Tang Guochun
..............page:55-63
A Polynomial Time Algorithm for the Economic Lot size Problem with Multiple Transportation Channels
Bai Qingguo;Xu Jianteng;Zhang Yuzhong
Bai Qingguo;Xu Jianteng;Zhang Yuzhong
..............page:73-82
Models to Hedge Whole Period Risks and Empirical Analysis
Xu Chengxian;Wang Zhao
Xu Chengxian;Wang Zhao
..............page:101-108
The Minimal Genus of Circular Graph C(n,m)
Wei Erling;Liu Yanpei;Li Zhaoxiang
Wei Erling;Liu Yanpei;Li Zhaoxiang
..............page:11-18
On a Primal-Dual Neural Network for Online
Zhang Yunong;Yi Chenfu;Ma Weimu
Zhang Yunong;Yi Chenfu;Ma Weimu
..............page:1-10
A Filter Algorithm for Minimax Problems
Yang Xiaohui
Yang Xiaohui
..............page:109-121