Ausgabe 3/2020
Inhalt (14 Artikel)
The complexity of total edge domination and some related results on trees
Zhuo Pan, Yu Yang, Xianyue Li, Shou-Jun Xu
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
Pawan Aurora, Shashank K. Mehta
Selfish colorful bin packing games
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco
A rapid learning automata-based approach for generalized minimum spanning tree problem
Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi, Kamal Mirzaie
Maximum weight induced matching in some subclasses of bipartite graphs
B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap
Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering
Shuangyao Zhao, Qiang Zhang, Zhanglin Peng, Xiaonong Lu
Complexity and characterization aspects of edge-related domination for graphs
Zhuo Pan, Xianyue Li, Shou-Jun Xu
Single machine batch scheduling with two non-disjoint agents and splitable jobs
Zhichao Geng, Jiayu Liu
A -approximation algorithm for the 2-Max-Duo problem
Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
Boosting node activity by recommendations in social networks
Wenguo Yang, Shengminjie Chen, Suixiang Gao, Ruidong Yan
Approximating the -relaxed soft capacitated facility location problem
Lu Han, Dachuan Xu, Yicheng Xu, Dongmei Zhang