Back to Top
Go Back
Journal Photo for Journal of Combinatorial Optimization
Peer reviewed only Open Access

Journal of Combinatorial Optimization (JCO)

Publisher : Springer Nature
Optimization Computer Science Mathematics
Claim Your Journal Get PRC Visit Website
e-ISSN 1573-2886
p-ISSN 1382-6905
Issue Frequency Bi-Monthly
Impact Factor 0.9
Est. Year 1997
Mobile 31786576000
Country Netherlands The
Language English
APC YES
Impact Factor Assignee Google Scholar
Email Yoka.Janssen@springernature.com

Journal Descriptions

This journal advances and promotes the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals. The Journal of Combinatorial Optimization is dedicated to advancing and promoting both the theory and applications of combinatorial optimization—a multidisciplinary research area at the intersection of applied mathematics, computer science, and operations research. This field extends into various domains, including computational complexity, computational biology, communication networks, management science, machine learning and artificial intelligence. The journal encompasses complexity analysis, algorithm design, including ML-based approaches, for optimization problems, numerical experiments, and problem discovery, with practical applications in science and engineering.

Journal of Combinatorial Optimization (JCO) is :-

  • International, Peer-Reviewed, Open Access, Refereed, Optimization, Computer Science, Mathematics , Online or Print , Bi-Monthly Journal

  • UGC Approved, ISSN Approved: P-ISSN P-ISSN: 1382-6905, E-ISSN: 1573-2886, Established: 1997, Impact Factor: 0.9
  • Does Not Provide Crossref DOI

  • Indexed in: Scopus, WoS

  • Not indexed in DOAJ, PubMed, UGC CARE

Indexing

Publications of JCO

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
Panos M. Pardalos November, 2024
A network for the transportation of supplies can be described as a rooted tree with a weight of a degree of congestion for each edge. We take the sum of root-leaf distance (SRD) on a rooted...
Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
Panos M. Pardalos August, 2023
Multicast transmissions in coded wireless packet networks can be affected by uncertain factors such as the distance between nodes. We develop a robust optimization method to minimize the ene...
A column-generation-based approach for an integrated service planning and physician scheduling problem considering re-consultation
Panos M. Pardalos September, 2022
In this paper, an integrated service planning and physician scheduling problem in the outpatient department is investigated, considering the re-consultation of patients as well as multiple t...
A novel approach to subgraph selection with multiple weights on arcs
Panos M. Pardalos November, 2021
In this paper, an extension of the minimum cost flow problem is considered in which multiple incommensurate weights are associated with each arc. In the minimum cost flow problem, flow is se...
Distributionally robust maximum probability shortest path problem
Panos M. Pardalos May, 2021
In this study, we discuss and develop a distributionally robust joint chance-constrained optimization model and apply it for the shortest path problem under resource uncertainty. In sch a ca...
Joint chance constrained shortest path problem with Copula theory
Panos M. Pardalos March, 2020
In this paper, we investigate the constrained shortest path problem where the arc resources of the problem are dependent normally distributed random variables. A model is presented to maximi...
A variation of DS decomposition in set function optimization
Panos M. Pardalos July, 2020
Any set function can be decomposed into the difference of two monotone nondecreasing submodular functions. This theorem plays an important role in the set function optimization theory. In th...
Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs
Panos M. Pardalos January, 2020
In this paper, we study a dynamic operating room scheduling problem which consists of three stages. The problem simultaneously tackles the capacity allocation of operating rooms to each spec...
Less is more approach for competing groups scheduling with different learning effects
Panos M. Pardalos January, 2020
This paper investigates a two-competing group scheduling problem on serial-batching machines considering setup times and truncated job-dependent learning effects. The objective is to minimiz...
Information security decisions for two firms in a market with different types of customers
Panos M. Pardalos August, 2019
This paper investigates an information security game between two competitive firms in a market consisting of loyal customers and switchers. The switchers are classified into unaggressive swi...