Ausgabe 2/2016
Complexity and Algorithm: A Special Issue Dedicated to the Memory of Professor Wenqi Huang
Inhalt (19 Artikel)
Guest Editorial
Introduction: Special issue dedicated to the memory of professor Wenqi Huang
Weidong Chen, Zhixiang Chen
Optimal space coverage with white convex polygons
Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari
Multi-start iterated tabu search for the minimum weight vertex cover problem
Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, Bo Peng
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
Qijia Liu, Jinjiang Yuan
Multi-neighborhood based path relinking for two-sided assembly line balancing problem
Zhaoyang Yang, Guojun Zhang, Haiping Zhu
Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
Xinyun Wu, Shengfeng Yan, Xin Wan, Zhipeng Lü
A three-phased local search approach for the clique partitioning problem
Yi Zhou, Jin-Kao Hao, Adrien Goëffon
Tabu search for the real-world carpooling problem
Can Huang, Defu Zhang, Yain-Whar Si, Stephen C. H. Leung
A hybrid algorithm based on variable neighbourhood for the strip packing problem
Defu Zhang, Yuxin Che, Furong Ye, Yain-Whar Si, Stephen C. H. Leung
Solving the maximum vertex weight clique problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü, Qinghua Wu
The expected values of Hosoya index and Merrifield–Simmons index in a random polyphenylene chain
Guihua Huang, Meijun Kuang, Hanyuan Deng
An effective discrete dynamic convexized method for solving the winner determination problem
Geng Lin, Wenxing Zhu, M. Montaz Ali
An -time exact algorithm for maximum -packing in cubic graphs
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
Total and paired domination numbers of bundles over a cycle
Fu-Tao Hu, Moo Young Sohn, Xue-gang Chen
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
Jihui Wang, Qiaoling Ma, Xue Han, Xiuyun Wang
A note on the duality between matchings and vertex covers in balanced hypergraphs
Robert Scheidweiler, Eberhard Triesch