1. The complexity of total edge domination and some related results on trees

   • Zhuo Pan
   • Yu Yang
   • Shou-Jun Xu

   OriginalPaper 05 June 2020 Pages: 571 - 589

   

2. A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation

   • Pawan Aurora
   • Shashank K. Mehta

   OriginalPaper 06 June 2020 Pages: 590 - 609

   

3. Selfish colorful bin packing games

   • Vittorio Bilò
   • Francesco Cellinese
   • Gianpiero Monaco

   OriginalPaper 11 June 2020 Pages: 610 - 635

   

4. A rapid learning automata-based approach for generalized minimum spanning tree problem

   • Masoumeh Zojaji
   • Mohammad Reza Mollakhalili Meybodi
   • Kamal Mirzaie

   OriginalPaper 13 June 2020 Pages: 636 - 659

   

5. A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints

   • Norelhouda Sekkal
   • Fayçal Belkaid

   OriginalPaper 20 June 2020 Pages: 660 - 696

   

6. Average eccentricity, minimum degree and maximum degree in graphs

   • P. Dankelmann
   • F. J. Osaye

   OriginalPaper 26 June 2020 Pages: 697 - 712

   

7. Maximum weight induced matching in some subclasses of bipartite graphs

   • B. S. Panda
   • Arti Pandey
   • Manav Kashyap

   OriginalPaper 28 June 2020 Pages: 713 - 732

   

8. Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering

   • Shuangyao Zhao
   • Qiang Zhang
   • Xiaonong Lu

   OriginalPaper 06 July 2020 Pages: 733 - 756

   

9. Complexity and characterization aspects of edge-related domination for graphs

   • Zhuo Pan
   • Xianyue Li
   • Shou-Jun Xu

   OriginalPaper 16 July 2020 Pages: 757 - 773

   

10. Single machine batch scheduling with two non-disjoint agents and splitable jobs

    • Zhichao Geng
    • Jiayu Liu

    OriginalPaper 16 July 2020 Pages: 774 - 795

    

11. Bottleneck subset-type restricted matching problems

    • Oleg Duginov

    OriginalPaper 20 July 2020 Pages: 796 - 805

    

12. A \((1.4 + \epsilon )\)-approximation algorithm for the 2-Max-Duo problem

    • Yong Chen
    • Guohui Lin
    • Peng Zhang

    OriginalPaper 25 July 2020 Pages: 806 - 824

    

13. Boosting node activity by recommendations in social networks

    • Wenguo Yang
    • Shengminjie Chen
    • Ruidong Yan

    ReviewPaper 28 July 2020 Pages: 825 - 847

    

14. Approximating the \(\tau \)-relaxed soft capacitated facility location problem

    • Lu Han
    • Dachuan Xu
    • Dongmei Zhang

    OriginalPaper 01 August 2020 Pages: 848 - 860