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. Key Features: Scope: The journal covers all theoretical, computational, and applied aspects of combinatorial optimization, providing a comprehensive platform for researchers and practitioners in the field. Reviews and Special Issues: In addition to research papers, the journal publishes reviews of relevant books and special issues dedicated to specific topics in combinatorial optimization. Author Satisfaction: A survey revealed that 100% of authors expressed their intent to definitely or probably publish in the journal again, reflecting a high level of satisfaction among contributors. By offering a forum for refereed papers, the Journal of Combinatorial Optimization contributes significantly to the ongoing development of combinatorial optimization. It plays a crucial role in disseminating cutting-edge research and fostering collaboration across disciplines, ensuring its relevance to a broad audience of scholars and professionals.