Skip to main content


Journal of Combinatorial Optimization

Journal of Combinatorial Optimization 1/2020

Ausgabe 1/2020

Inhaltsverzeichnis ( 14 Artikel )

13.03.2020 | Ausgabe 1/2020

Plane graphs with are entirely 10-colorable

Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang

16.03.2020 | Ausgabe 1/2020

Approximating the asymmetric p-center problem in parameterized complete digraphs

Wei Ding, Ke Qiu

19.03.2020 | Ausgabe 1/2020

A variation of DS decomposition in set function optimization

Xiang Li, H. George Du, Panos M. Pardalos

06.04.2020 | Ausgabe 1/2020

Planar graphs without 4- and 6-cycles are (7 : 2)-colorable

Haitao Wu, Yaojun Chen, Xiaolan Hu

09.04.2020 | Ausgabe 1/2020

Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number

Yan Liu, Mengxia Lei, Xueli Su

09.04.2020 | Ausgabe 1/2020

A -approximation algorithm for coloring rooted subtrees of a degree 3 tree

Anuj Rawat, Mark Shayman

11.04.2020 | Ausgabe 1/2020

Secure domination of honeycomb networks

M. R. Chithra, Manju K. Menon

13.04.2020 | Ausgabe 1/2020

Joint chance constrained shortest path problem with Copula theory

Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar, Panos M. Pardalos

22.04.2020 | Ausgabe 1/2020

Classification optimization for training a large dataset with Naïve Bayes

Thi Thanh Sang Nguyen, Pham Minh Thu Do

24.04.2020 | Ausgabe 1/2020

An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown

Ji Tian, Yan Zhou, Ruyan Fu

25.04.2020 | Ausgabe 1/2020

New restrictions on defective coloring with applications to steinberg-type graphs

Addie Armstrong, Nancy Eaton

08.05.2020 | Ausgabe 1/2020

KATZ centrality with biogeography-based optimization for influence maximization problem

Abbas Salehi, Behrooz Masoumi

15.05.2020 | Ausgabe 1/2020

The strong chromatic index of graphs with edge weight eight

Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou

28.05.2020 | Ausgabe 1/2020

Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem

Fernando A. Morales, Jairo A. Martínez

Aktuelle Ausgaben

Premium Partner