Issue 3/2021
Special Issue: Combinatorial Optimization and Applications (COCOA) 2017
Content (18 Articles)
On the complexity and approximability of repair position selection problem
Xianmin Liu, Yingshu Li, Jianzhong Li, Yuqiang Feng
A spectral partitioning algorithm for maximum directed cut problem
Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu, Dongmei Zhang
On the complexity of and algorithms for detecting k-length negative cost cycles
Longkun Guo, Peng Li
A dynamic approach to detecting, eliminating and fixing memory leaks
Bin Yu, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du
Mixed connectivity properties of random graphs and some special graphs
Ran Gu, Yongtang Shi, Neng Fan
Tropical paths in vertex-colored graphs
Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham
Algorithms for the metric ring star problem with fixed edge-cost ratio
Xujin Chen, Xiaodong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang, Ying Zhang
An improved algorithm for the -MaxSAT problem: asking branchings to satisfy the clauses
Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang
The spectral radius and domination number in linear uniform hypergraphs
Liying Kang, Wei Zhang, Erfang Shan
Big data driven urban railway planning: Shenzhen metro case study
Wen Xu, Caiwei Yuan, Keke Peng, Hongwei Du
Modified Greedy Heuristic for the one-dimensional cutting stock problem
Gonçalo R. L. Cerqueira, Sérgio S. Aguiar, Marlos Marques