Overview
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.
- Editor-in-Chief
-
- My T. Thai
- Impact factor
- 1.0 (2022)
- 5 year impact factor
- 1.1 (2022)
- Submission to first decision (median)
- 53 days
- Downloads
- 144,059 (2023)
Latest articles
Journal information
- Electronic ISSN
- 1573-2886
- Print ISSN
- 1382-6905
- Abstracted and indexed in
-
- ABS Academic Journal Quality Guide
- ACM Digital Library
- ANVUR
- BFI List
- Baidu
- CLOCKSS
- CNKI
- CNPIEC
- Chimica
- Current Contents/Engineering, Computing and Technology
- Current Contents/Physical, Chemical and Earth Sciences
- DBLP
- Dimensions
- EBSCO
- ECONIS
- EI Compendex
- Google Scholar
- INSPEC
- Japanese Science and Technology Agency (JST)
- Mathematical Reviews
- Naver
- OCLC WorldCat Discovery Service
- Portico
- ProQuest
- SCImago
- SCOPUS
- Science Citation Index Expanded (SCIE)
- TD Net Discovery Service
- UGC-CARE List (India)
- Wanfang
- zbMATH
- Copyright information
-
© Springer Science+Business Media, LLC, part of Springer Nature