Journal of Combinatorial Optimization

1997 - 2026

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

2026, volume 51, articles 1

Publisher Correction: Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs No 1, 3 pages

Guantao Chen, Guangming Jing and Wenan Zang

Structured query language injection attack detection via giant magnificent frigatebird optimization and federated learning No 10, 38 pages

Madhavi Perla and Valli Kumari Vatsavayi

Hytranet: a deep learning model for traffic congestion prediction in road networks No 11, 22 pages

Manoj Kumar and Kranti Kumar

On the transmission irregular trees with the maximum Wiener index No 12, 27 pages

Ivan Damnjanović, Anran Xu and Kexiang Xu

Strong edge-coloring of graphs with maximum edge weight seven No 2, 11 pages

Runze Wang

Constructing the antimagic labelings for double stars union paths on three vertices No 3, 17 pages

Wei-Tian Li and Po-Wen Yang

An integer model for optimizing dynamic allocation of medical supplies during the COVID-19 No 4, 31 pages

Hongqiang Fan, Shuyao Duan, Xun Weng, Jingtian Zhang and Lifen Yun

Solving systems of equations on antichains for the computation of the ninth Dedekind Number No 5, 26 pages

Patrick De Causmaecker and Lennart Van Hirtum

Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint No 6, 23 pages

Tan D. Tran and Canh V. Pham

Distributionally robust one-class support vector machine for anomaly detection under uncertainty No 7, 36 pages

Amirhossein Noormohammadi, Seyed Ali MirHassani and Farnaz Hooshmand Khaligh

Adaptive latent space dip clustering and few-shot wavelet learning for android malware detection No 8, 32 pages

K. Selvi, P. Vijayalakshmi, B. Selvalakshmi and G. Manikandan

Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions No 9, 17 pages

Byung-Cheon Choi and Myoung-Ju Park

2025, volume 50, articles 5

Near-bipartiteness on graphs having small dominating sets No 1, 17 pages

Maria Luiza L. da Cruz, Raquel Bravo, Rodolfo A. Oliveira and Ueverton S. Souza

Total domination and open packing in some subclasses of bipartite graphs No 2, 60 pages

M. A. Shalu and V. K. Kirubakaran

A comparative computational study for parallel-machine problems with sustainable manufacturing constraints No 3, 40 pages

Levi R. Abreu and Bruno A. Prata

Single machine lot scheduling with maintenance activity No 4, 22 pages

Baruch Mor, Gur Mosheiov and Dana Shapira

Faster algorithms for 3-leaf power modification problems No 5, 14 pages

Dekel Tsur

2025, volume 50, articles 4

On injective edge coloring of sparse graphs with maximum degree 5 No 1, 21 pages

Yanqing Wu

Dominance for enclosure problems No 10, 20 pages

Waseem Akram and Sanjeev Saxena

Solution of stochastic facility location problems with combinatorially many decision-dependent distributions No 11, 32 pages

Giovanni Pantuso

A quantum genetic algorithm for a parallel machine scheduling problem No 2, 22 pages

Tilmann Schwenzow, Annika Lehnert, Christoph Liebrecht, Jörg Franke and Sebastian Reitelshöfer

Hot potato or valuable opportunity: e-tailer’s support for competitor logistics service No 3, 29 pages

Zeling Xu, Li Liu and Feiyu Guo

Reinforcement learning-guided adaptive large neighborhood search for vehicle routing problem with time windows No 4, 24 pages

Zhaohui Wang, Qiao Cui, Bin Tan, Xiao Yang, Weibang Zhou and Xiangsheng Huang

Low-degree spanning trees of 2-edge-connected graphs in linear time No 5, 8 pages

Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński, Michał Zakrzewski and Paweł Żyliński

Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem No 6, 28 pages

Salman Khodayifar and Mohammadreza Farjaie

Valid inequalities for the $$\beta $$ -edge disruptor problem No 7, 29 pages

Sheng-Jie Chen, Guang-Ming Li, Liang Chen, Caixia Kou and Yu-Hong Dai

Advancing discrete optimization: novel approaches with dataless neural networks No 8, 20 pages

Sangram K. Jena, K. Subramani and Alvaro Velasquez

Face recognition using life-centroid distance between featured persistence diagrams No 9, 22 pages

Nilanjana Karmakar and Arindam Biswas

2025, volume 50, articles 3

Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs No 1, 91 pages

Guantao Chen, Guangming Jing and Wenan Zang

Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs No 2, 15 pages

Jing Zhang, Rubing Chen, Jinjiang Yuan, C. T. Ng and T. C. E. Cheng

EmoMAC: a bias-induced multimodal fusion model for emotional analysis with visualization analytics enabled through super affective computing in emails No 3, 48 pages

C. Pabitha, K. Revathi, W. Gracy Theresa, Pornpimol Chawengsaksopark and Mithileysh Sathiyanarayanan

Investigation of discriminatory government subsidies for fuel vehicles and new energy vehicles by considering trade-ins No 4, 39 pages

Baoyu Liao, Mengyu Sun, Xiaoxi Zhu and Panos M. Pardalos

The multi-terminal vertex separator problem: total dual integrality and polytope composition No 5, 42 pages

Y. Magnouche, A. R. Mahjoub and S. Martin

Quadratization and convexification in polynomial binary optimization No 6, 47 pages

Yves Crama, Sourour Elloumi, Amélie Lambert and Elisabeth Rodríguez-Heck

Transitivity in some graph-classes No 7, 29 pages

Subhabrata Paul and Kamal Santra

Optimal intelligent investment strategy in competing supply chains of electric vehicle charging facilities No 8, 38 pages

Baoyu Liao and Wenting Wang

Stochastic single-machine scheduling problems with both time-dependent deterioration and position-dependent learning effect No 9, 17 pages

Yuncheng Luo

2025, volume 50, articles 2

Strategy-proof mechanisms for maximizing social satisfaction in the facility location game No 1, 20 pages

Xiaowei Li and Xiwen Lu

Quaternion-based formulations for volume maximisation problems No 10, 35 pages

Jonas Tollenaere and Tony Wauters

An improvement on the Louvain algorithm using random walks No 2, 26 pages

Duy Hieu Do and Thi Ha Duong Phan

Moving horizon capacitated arc routing problem No 3, 35 pages

Somnath Buriuly, Leena Vachhani, Arpita Sinha, Sivapragasam Ravitharan and Sunita Chauhan

Semistrong edge colorings of planar graphs No 4, 30 pages

Yuquan Lin and Wensong Lin

Maximum expert consensus models with both type- $$\alpha $$ and type- $$\varepsilon $$ constraints No 5, 23 pages

Dong Cheng, Huina Zhang and Yong Wu

A divide-and-conquer based preprocessing for routing in a simple polygon No 6, 18 pages

Siddharth Gaur and R. Inkulu

Embedding crossed cube into diverse product graphs and tree-derived architectures No 7, 21 pages

Paul Immanuel and A. Berin Greeni

Graph Coloring problem solving using monte carlo tree search and deep reinforcement learning No 8, 21 pages

Wenzhu Yang and Zhanshan Li

General Sombor index: a study of branching in trees and solution for maximal trees with prescribed maximum degree No 9, 23 pages

Sultan Ahmad and Kinkar Chandra Das

2025, volume 50, articles 1

Single machine lot scheduling to minimize maximum weighted completion time No 1, 36 pages

Feifeng Zheng, Na Li, Ming Liu and Yinfeng Xu

Mutually dependent, balanced contributions, and the priority value No 10, 16 pages

Songtao He, Erfang Shan and Yuxin Sun

Hybrid quantum-enhanced reinforcement learning for energy-efficient resource allocation in fog-edge computing No 11, 36 pages

S. Sureka Nithila Princy and Paulraj Ranjith Kumar

Bivalent quadratic optimization with sum-of-square of quadratic penalties No 12, 17 pages

Tongli Zhang and Yong Xia

Synchronizing production planning and job scheduling: MILP models and exact algorithms No 2, 21 pages

Aurélien Mombelli and Alain Quilliot

On the initial transition of graphs of Kirkman schedules by the partial team swap No 3, 19 pages

Yusuke Kashiwagi, Masaki Yamamoto and Takamasa Yashima

Algorithms for 2-balanced connected k-partition problem in graphs No 4, 19 pages

Junran Yu, Jing Hu, Jiaquan Gao, Donglei Du and Xiaoyan Zhang

Approximate maximin share allocation for indivisible goods under a knapsack constraint No 5, 16 pages

Bin Deng and Weidong Li

New Challenges in Combinatorial Optimization No 6, 5 pages

Bo Chen, Alexander Kulikov and Silvano Martello

Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model No 7, 40 pages

Hengzhao Ma and Jianzhong Li

A Branch–Reduction–Bound algorithm for linear fractional multi-product planning problems No 8, 21 pages

Xianfeng Ding and Meiling Hu

An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm No 9, 35 pages

Yuli Wang, Wenjuan Fan, Shaowen Lan, Shuwan Zhu and Jianmei Du