Ausgabe 2/2021
Inhalt (16 Artikel)
Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
Ji-Bo Wang, Bo Cui, Ping Ji, Wei-Wei Liu
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali
Differentially private approximate aggregation based on feature selection
Zaobo He, Akshita Maradapu Vera Venkata Sai, Yan Huang, Daehee seo, Hanzhou Zhang, Qilong Han
Group level social media popularity prediction by MRGB and Adam optimization
Navdeep Bohra, Vishal Bhatnagar
Application of optimization methods in the closed-loop supply chain: a literature review
Luttiely Santos Oliveira, Ricardo Luiz Machado
Secure domination in rooted product graphs
Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez
Approximation algorithm for the multicovering problem
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Bounds on the semipaired domination number of graphs with minimum degree at least two
Teresa W. Haynes, Michael A. Henning
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
The balanced double star has maximum exponential second Zagreb index
Roberto Cruz, Juan Daniel Monsalve, Juan Rada