Date

Time

Contents

July 18

A.M.

14:00 - 18:00

Registration

18:00

Reception

July 19

A.M.

8:30 – 9:00

Opening Ceremony

9:00 – 9:30

Photographing

Session 1

Chair:

9:30 – 10:30

Invited Talk of Prof. Zhiming Ma

Comparison of Two Algorithms for Computing Page Importance

10:30 – 10:45

Coffee Break

10:45 – 11:15

Binhai Zhu.

Efficient Algorithms for the Complement of Maximal Strip Recovery

11:15 – 11:45

Reinhard Bauer, Marcus Krug, Sascha Meinert and Dorothea Wagner.

Synthetic Road Networks

11:45 – 12:15

Songbo Huang, T.W. Lam, W.K. Sung, S.L. Tam and S.M. Yiu.

Indexing Similar DNA Sequences

12:20

Lunch

July 19

P.M.

Session 2

Chair:

14:00 – 14:30

Bin Fu, Yumei Huo and Hairong Zhao.

Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints

14:30 – 15:00

Wenchang Luo, Lin Chen and Guochuan Zhang.

Approximation algorithms for scheduling with a variable machine maintenance

15:00 – 15:30

Ming Liu, Chengbin Chu and Yinfeng Xu.

Online scheduling on two uniform machines to minimize the makespan with a periodic availability constraint

15:30 – 16:00

Cuixia Miao, Yuzhong Zhang and Chengfei Wang.

Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines

16:00 – 16:20

Coffee Break

Session 3

Chair:

16:20 – 16:50

Yong Wu and Qifan Yang.

Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision

16:50 – 17:20

Feifeng Zheng, Bo Liu, Yinfeng Xu and E Zhang.

Online Splitting Interval Scheduling on m Identical Machines

17:20 – 17:50

Yong Zhang, Zhuo Chang, Francis Chin, Hing-Fung Ting and Yung Tsin.

Online Uniformly Inserting Points on Grid

18:00

Dinner

July 20

A.M.

Session 4

Chair: Bo Chen

8:00 – 9:00

Invited Talk of Prof. Daniel Ralph

The Invisible Hand for Risk Averse Investment in Electricity Generation

9:00 – 9:30

Esther Arkin, Nili Guttmann-Beck and Refael Hassin.

The (K, k)-Capacitated Spanning Tree Problem

9:30 – 10:00

Qiaoming Han and Abraham Punnen.

On the approximability of the vertex cover and related problems

10:00 – 10:15

Coffee Break

Session 5

Chair:

10:15 – 10:45

Zhi-Zhong Chen.

Approximating Maximum Edge 2-Coloring in Simple Graphs

10:45 – 11:15

Zhi-Zhong Chen, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang and Binhai Zhu.

A Linear Kernel for Co-Path/Cycle Packing

11:15 – 11:45

Yong Zhang and Ge Xia.

Kernelization for Cycle Transversal Problems

11:45 – 12:15

Yujun Zheng.

Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-Criteria Analysis

12:20

Lunch

July 20

P.M.

14:00 – 16:00

Excursion

18:30

Banquet and Dinner

July 21

A.M.

Session 6

Chair:

8:00 – 8:30

Zhen Wang, Donglei Du and Dachuan Xu.

A primal-dual approximation algorithm for the k-level stochastic facility location problem

8:30 – 9:00

Chenglin Fan and Jun Luo.

Point Location in the Continuous-Time Moving Network

9:00 – 9:30

Xiucui Guan and Binwu Zhang.

Inverse 1-median Problem on Trees under Weighted L_¥ Norm

9:30 – 10:00

Wenqiang Dai.

Some Results on Incremental Vertex Cover Problem

10:00 – 10:15

Coffee Break

Session 7

Chair:

10:15 – 10:45

Dag Haugland and Sin C. Ho.

Feasibility testing for dial-a-ride problems

10:45 – 11:15

Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter and Paul Molitor.

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

11:15 – 11:45

E. Alvarez-Miranda, A. Candia, X. Chen, X. Hu and Bi Li.

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

11:45 – 12:15

Fabrice Talla Nobibon, Cor Hurkens, Roel Leus and Frits C.R. Spieksma.

Exact Algorithms for Coloring Graphs while Avoiding Monochromatic Cycles

12:20

Lunch

July 21

P.M.

Session 8

Chair:

14:00 – 14:30

Hui Zhang, Qing Guo and Costas Iliopoulos.

Varieties of Regularities in Weighted Sequences

14:30 – 15:00

Vittorio Bilo' and Angelo Fanelli.

Computing Exact and Approximate Nash Equilibria in 2-Player Games

15:00 – 15:30

Lusheng Wang, Yong Yang and Guohui Lin.

Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive

15:30 – 16:00

Qing-Guo Bai and Jian-Teng Xu.

Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-Supplier

16:00 – 16:20

Coffee Break

Session 9

Chair:

16:20 – 16:50

Lixia Liu and Sanyang Liu.

A new smoothing Newton method for symmetric cone complementarity problems

16:50 – 17:20

Yajun Chai and Bo Liu.

Where Would Changing in Use of Proceeds from Refinancing Go?

17:20 – 17:50

Jun Dai, Liyun Ni, Xiangrong Wang and Weizhong Chen.

A VaR Algorithm for Warrants Portfolio

18:30

Dinner