Journal of Combinatorial Optimization

Aims & Scope

The objective of Journal of Combinatorial Optimization is to advance and promote 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.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.1
2024	0.90

Journal Rank

Year	Value
2024	13068

Journal Citation Indicator

Year	Value
2024	779

SJR (SCImago Journal Rank)

Year	Value
2024	0.432

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	57

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• The unconstrained binary quadratic programming problem: a survey

  Citation: 352

  Authors: Gary, Jin-Kao, Fred, Mark, Zhipeng, Haibo, Yang

• Hybrid Evolutionary Algorithms for Graph Coloring

  Citation: 347

  Authors: Philippe, Jin-Kao

• Coverage by directional sensors in randomly deployed wireless sensor networks

  Citation: 326

  Authors: Jing, Alhussein A.

• Ant Colony System for a Dynamic Vehicle Routing Problem

  Citation: 315

  Authors: R., L. M., A. E., A. V.

• Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results

  Citation: 235

  Authors: Clemens

• A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

  Citation: 229

  Authors: M., M.G.C., P.M.

• Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

  Citation: 221

  Authors: A.A., M.I.

• Operating room planning and surgical case scheduling: a review of literature

  Citation: 173

  Authors: Shuwan, Wenjuan, Shanlin, Jun, Panos M.

• Semidefinite Programming Relaxations for the Quadratic Assignment Problem

  Citation: 150

  Authors: Qing, Stefan E., Franz, Henry

• Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures

  Citation: 146

  Authors: L.D., P., J.C., D.-S.

---