Skip to main content
Log in

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

Journal metrics

Journal Impact Factor
1.1 (2024)
5-year Journal Impact Factor
1.1 (2024)
Submission to first decision (median)
57 days
Downloads
139.9k (2024)

Calls for papers

View all calls for papers

Latest articles

Journal updates

  • Selected Papers from TAMC 2025

    Rationale and Scope

    This Special Issue will feature high quality papers from TAMC 2025, focusing on algorithm design, computational complexity, and interdisciplinary applications. Key topics include: 

    • Computational complexity and algorithms 
    • Models of computation
    • Automata theory and formal languages
    • Quantum computing
    • Algorithmic game theory
    • Cryptography and data security
    • Computational biology and bioinformatics
    • Parallel and distributed computing
    • Formal verification and program analysis
    • Computational geometry and graph theory
    • Logic and proof theory
    • Computational social choice
    • Combinatorial optimization

    These topics align with JOCO's mission to advance algorithmic theory and its practical impact. The issue bridges foundational research and real world challenges in emerging technologies.

    Guest Editors

    Dr. Donglei Du

    University of New Brunswick, Canada 

    Fields of Interest: Operations Research, Approximations algorithms, Machine Scheduling

    Homepage: https://www.unb.ca/faculty-staff/directory/management/du-donglei.html

    Dr. Donglei Du is a professor in Quantitative Method and Quantitative Investment Management at the Faculty of Management (FOM), University of New Brunswick (UNB), Canada. His main research interests are Quantitative Investment Management, Quantitative Finance, FinTech (Blockchain and cryptocurrencies) Operations Research, Algorithmic trading, Combinatorial Optimization, Approximations algorithms, Robust optimization, Social Network Analysis, Algorithmic Game Theory, Supply Chain Management, Facility Location, and Machine Scheduling. Dr. Du's publications have appeared in top-tier journals, including Operations Research, Algorithmica, SIAM Journal on Discrete Mathematics, European Journal of Operation Research and Omega. He received several awards from UNB at both the university and faculty levels, including the University Research Scholar (UNB, 2014), University Merit Award (UNB, twice, 2006 and 2012), Excellence in Research Award (FBA, 2007), and Annual Research Award (FBA, 2004).


    Dr Min Li

    Shandong Normal University, Jinan, China

    Fields of Interest: Approximation Algorithms, Submodular Optimization

    Homepage: http://www.maths.sdnu.edu.cn/info/1831/32371.htm

    Dr. Min Li is a professor at Shandong Normal University, specializing in approximation algorithms, submodular optimization, and integer programming. She has published over 40 SCI/EI papers in top journals and conferences such as Journal of Global Optimization and Theoretical Computer Science. With extensive experience leading research projects and serving as a reviewer for Mathematical Reviews, she brings both academic expertise and editorial insight to this special issue.


    Dr Mingji Xia

    Institute of Software, Chinese Academy of Sciences, Beijing, Ch

    Fields of Interest: Computational Complexity, Holographic Algorithms

    Homepage: https://people.ucas.ac.cn/~xiamingji#%20303524

    Dr. Mingji Xia is a researcher at the Institute of Software, Chinese Academy of Sciences, specializing in computational complexity and counting problems. He earned his Ph.D. from ISCAS in 2008 and conducted postdoctoral research at the Max Planck Institute. His work on Holant problems, holographic algorithms, and tensor networks has been published in top journals and conferences like SIAM Journal on Computing and STOC. Dr. Xia’s expertise spans theoretical computer science and its applications, making him a qualified contributor to this special issue

  • COCOON 2024 Call for Papers

    The 30th International Computing and Combinatorics Conference (COCOON 2024) will be held in Shanghai, China during August 23-25, 2024. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.


    Topics of interest
    The topics include, but are not limited to:
    • Algorithms and Data Structures
    • Algorithmic Game Theory and Online Algorithms
    • Automata, Languages, Logic, and Computability
    • Combinatorics Related to Algorithms and Complexity
    • Complexity Theory
    • Computational Learning Theory and Knowledge Discovery
    • Cryptography, Reliability, Security, and Database Theory
    • Computational Biology and Bioinformatics
    • Computational Algebra, Geometry, and Number Theory
    • Graph Drawing and Information Visualization
    • Communication Networks, and Optimization
    • Parallel and Distributed Computing


    We particularly encourage submissions in emerging topics of high importance such as algorithms, data structures, machine learning, quantum computing, computational social science, blockchain, cyber-physical systems, bio-inspired computing, and human-computer interaction.


    Important Dates
    • Paper Submission Due: Apr. 8, 2024 (AoE)
    • Author Notification: May. 25, 2024 (AoE)
    • Camera-Ready: Jun.10, 2024 (AoE)
    • Conference Date: Aug.23 - Aug.25, 2024
    *All deadlines expire on 23:59 AoE (UTC - 12)


    Paper Submission
    The conference proceedings of COCOON 2024 will be published by Springer in Lecture Notes in Computer Science (LNCS). The submission should contain scholarly exposition of ideas,
    techniques, and results, including the motivation and a clear comparison with related work. The length of the submission should not exceed 12 pages in LNCS style (including references, but excluding the optional appendix).


    Submitted papers must describe work not previously published. They must not be submitted simultaneously to any other conference with refereed proceedings or to journals. We regard the following case as a simultaneous submission. Submission of drafts which contain the essentially same results from papers under review in other conferences or journals at the moment of the submission. Only electronic PDF submission will be allowed via the Springer Online Conference System. Please check conference webpage for more details.


    The submitted papers will be reviewed in a double-blind peer review manner.
    The submission server is now available at https://equinocs.springernature.com/service/cocoon2024.

  • SI: Combinatorial Optimization in Imaging Sciences

    Guest Editors: Reneta Barneva (SUNY at Fredonia, USA) and Tibor Lukić (University of Novi Sad, Serbia)

    Submission Deadline: October 15, 2020

    The main objective of this special issue is to stimulate researchers to advance the theory of combinatorial optimization and its implementation in developing novel machine intelligence for imaging sciences. Authors are expected to propose original ideas and develop new techniques, structural results, and algorithms that improve researchers’ ability to solve practical problems.


Journal information

Electronic ISSN
1573-2886
Print ISSN
1382-6905
Abstracted and indexed in
  1. ABS Academic Journal Quality Guide
  2. ACM Digital Library
  3. ANVUR
  4. BFI List
  5. Baidu
  6. CLOCKSS
  7. CNKI
  8. CNPIEC
  9. Chimica
  10. Current Contents/Engineering, Computing and Technology
  11. Current Contents/Physical, Chemical and Earth Sciences
  12. DBLP
  13. Dimensions
  14. EBSCO
  15. ECONIS
  16. EI Compendex
  17. Google Scholar
  18. INSPEC
  19. Japanese Science and Technology Agency (JST)
  20. Mathematical Reviews
  21. Naver
  22. OCLC WorldCat Discovery Service
  23. Portico
  24. ProQuest
  25. SCImago
  26. SCOPUS
  27. Science Citation Index Expanded (SCIE)
  28. TD Net Discovery Service
  29. Wanfang
  30. eLibrary.ru
  31. zbMATH

© Springer Science+Business Media, LLC, part of Springer Nature

Journal navigation