Ausgabe 1/2020
Inhalt (14 Artikel)
A variation of DS decomposition in set function optimization
Xiang Li, H. George Du, Panos M. Pardalos
Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number
Yan Liu, Mengxia Lei, Xueli Su
Joint chance constrained shortest path problem with Copula theory
Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar, Panos M. Pardalos
Classification optimization for training a large dataset with Naïve Bayes
Thi Thanh Sang Nguyen, Pham Minh Thu Do
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
Ji Tian, Yan Zhou, Ruyan Fu
New restrictions on defective coloring with applications to steinberg-type graphs
Addie Armstrong, Nancy Eaton
KATZ centrality with biogeography-based optimization for influence maximization problem
Abbas Salehi, Behrooz Masoumi
The strong chromatic index of graphs with edge weight eight
Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou
Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem
Fernando A. Morales, Jairo A. Martínez