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 52, articles 4

A new form of Gallai theorem on regular hypergraphs No 1, 13 pages

Zhongzheng Tang, Haoyang Zou and Zhuo Diao

Asymmetric number partitioning with splitting No 10, 45 pages

Samuel Bismuth, Erel Segal-Halevi and Dana Shapira

Trustaware-x: integrating game-theoretic incentives, reinforcement learning, and shapley value fair compensation in blockchain-secured federated learning No 11, 19 pages

Phuc Tran-Vinh, Thai-Minh Truong and Cuong Pham-Quoc

Beacon-based indoor positioning system using link quality indicator assisted adaptive weighted centroid localization approach No 12, 31 pages

Sumit Kumar and Priyanka Bhutani

Fault-free Hamiltonian cycles with prescribed edges in hypercubes with faulty edges No 13, 14 pages

Fan Wang and Qing Zhu

Minimum Randić index of molecular trees with a perfect matching No 2, 13 pages

Jianwei Du and Xiaoling Sun

Computation and analysis of the face index for benzenoid planar octahedron networks No 3, 13 pages

Jai Parkash and Vijay Kumar Bhat

Improved approximation algorithm for min-max correlation clustering problem with penalties No 4, 20 pages

Yuebo Huang, Sai Ji, Xiaoyun Tian and Kun Zhou

An approximation algorithm for solving the many-visits prize-collecting path traveling salesman problem No 5, 22 pages

Jianping Li, Hong Li, Wei Li, Runtao Xie and Xiaoxiao Yang

An approximation algorithm for the prize-collecting partial scenario set cover problem No 6, 12 pages

Mengyu Cui, Hao Zhang, Bo Hou, Yisheng Zhou and Wen Liu

Enhancing physical layer security for UAV-assisted satellite-vehicle communication network No 7, 28 pages

Shanchao Zheng, Deying Li, Yongcai Wang and Wenping Chen

The rainbow number of small cycles with a pendant edge in maximal outerplanar graphs No 8, 13 pages

Liman Jiao, Yongxin Lan and Changqing Xu

Multi-objective solid transshipment problem with triangular intuitionistic fuzzy coefficients No 9, 37 pages

Karampreet Kaur and Sandeep Singh

2026, volume 52, articles 3

$$K_{1,r}$$ K 1, r -structure connectivity and neighbor connectivity in hierarchical networks No 1, 24 pages

Liying Zhao, Shumin Zhang, Bo Zhu and Jou-Ming Chang

Minimum power partial cover meets fairness: improved approximation guarantees No 10, 21 pages

Chensheng Ma, Mingchao Zhou, Qingye Shou and Zhao Zhang

Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem No 11, 18 pages

Junran Lichen, Shuwen Ge, Runtao Xie and Ping Yang

Exact algorithms for solving the constrained convex combinatorial assignment problems with bounds and maximum penalty No 12, 15 pages

Guojun Hu, Pengxiang Pan, Junran Lichen, Lijian Cai and Binchao Huang

Approximation algorithm for parallel-batch scheduling with resource matching and rejection No 13, 20 pages

Wenhua Li, Liang Zhang, Ran Lin and Shisheng Li

An FPT approximation algorithm for the partition set cover problem with penalties No 2, 12 pages

Hao Zhang, Bo Hou, Gengsheng Zhang, Ke Li and Wen Liu

Approximation algorithms for the minimum b-matching blocker problem on bipartite graphs No 3, 15 pages

Ruiqing Sun and Weidong Li

Lanzhou index of trees with perfect matching No 4, 12 pages

Xuan Zhao, Ke Zhao and Fang Zhu

Multi-set function maximization with application in viral marketing No 5, 20 pages

Chensheng Ma, Hongbin G. Du, Hongmin W. Du and Zhao Zhang

Greedy approximation for the minimum (1, m)-connected dominating set with labeling No 6, 15 pages

Tianshuo Lv, Bo Hou, Wen Liu and Ke Li

Submodular maximization under knapsack and partition matroid constraints No 7, 20 pages

Dongkai Xu, Jianhua Yuan and Zhongzheng Tang

Navigating uncertainties in medical logistics: the power of big data and information transparency No 8, 32 pages

Mingchuan You, Zhiyong Zhang and Yongqiang Shi

Compact SAT encoding for power peak minimization in assembly line balancing No 9, 33 pages

Tuyen Van Kieu, Phong Chi Nguyen, Bao Gia Hoang and Khanh Van To

2026, volume 52, articles 2

Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs No 1, 52 pages

Lluís Alemany-Puig, Juan Luis Esteban and Ramon Ferrer-i-Cancho

Branch and price algorithm for the stop number minimization problem No 2, 45 pages

Victor Nascimento and Luidi Simonetti

Uncertainty-aware multi-objective optimization for rebalancing bike shared systems No 3, 27 pages

Diego Daniel Pedroza-Perez, Gabriel Luque, Sergio Nesmachnow and Jamal Toutouh

Perfect hierarchical matchings in graphs No 4, 52 pages

Ian G. Ludden, Ellen Veomett and Sheldon H. Jacobson

Shortest longest-path graph orientations No 5, 30 pages

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue and Shay Zakov

Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs No 6, 37 pages

Miguel Del-Rio-Palma, Carlos Arturo Rodriguez Palma and Simone Dantas

A short proof and experimental study of the approximation algorithm for label s-t cut No 7, 21 pages

Peng Zhang

Directed star packing: Tractability, inapproximability, and approximation algorithms No 8, 34 pages

Yue Sun, Zhikai Chen, Mingyang Gong, Guohui Lin and Dachuan Xu

Parallel-machine scheduling with weighted earliness-tardiness and optional job rejection No 9, 34 pages

Ren-Xia Chen, Shi-Sheng Li and Cheng-Wen Jiao

2026, volume 52, articles 1

The latest developments in combinatorial optimization No 1, 5 pages

Silvano Martello, Greet Vanden Berghe and Tony Wauters

On finding all roots to systems of nonlinear equations using large language models No 10, 21 pages

Alexander Semenov, Michael J. Hirsch and Panos M. Pardalos

Efficient algorithms for computing the edit distance with non-overlapping inversions No 11, 20 pages

Kuan-Lin Lai, Shie-Yan Lee, Chang-Biau Yang and Kuo-Tsung Tseng

Open problems on Euler (elliptic) Sombor index of graphs No 12, 36 pages

Sneha Sekar, Kinkar Chandra Das, Selvaraj Balachandran and Suresh Elumalai

Routing among Convex Polygonal Obstacles in the Plane using a Simplified Domain No 13, 18 pages

Siddharth Gaur and R. Inkulu

Two approximation algorithms for solving the min–max heterogeneous weighted delivery problem No 14, 23 pages

Jianping Li, Ping Yang, Junran Lichen and Runtao Xie

Partial Fitch graphs: characterization, satisfiability and complexity No 15, 23 pages

Marc Hellmuth, Annachiara Korchmaros, José Antonio Ramírez-Rafael, Bruno Schmidt, Peter F. Stadler and Sandhya Thekkumpadan Puthiyaveedu

Mechanism design for facility location games under a prelocated facility No 2, 34 pages

Genjie Qin, Qizhi Fang and Wenjing Liu

Neighbor-distinguishing index of IC-planar graphs No 3, 25 pages

Zhengyue He, Weifan Wang and Lina Zheng

Fast Algorithms for Monotone Submodular Meta-Learning under the Cardinality Constraint No 4, 27 pages

Shufang Gong, Bin Liu, Qizhi Fang and Weili Wu

Deterministic algorithms for k-submodular maximization with the chance constraint No 5, 21 pages

Shufang Gong, Qiao Chen and Bin Liu

Algorithms with competitive analysis for online traveling salesman problem on a semi-line No 6, 19 pages

Kai Wang, Qian Liu, An Zhang, Yong Chen and Guangting Chen

Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines No 7, 15 pages

Ruiqing Sun

Linear convergence property of a new projection algorithm for split feasibility problem with multiple output sets No 8, 21 pages

Xiaojie Sun, Meixia Li, Biao Qu and Jingjing Tan

Random Schreier graphs as expanders No 9, 48 pages

Geoffroy Caillat-Grenier