Journal of Combinatorial Optimization

1997 - 2025

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.

2025, volume 49, articles 3

Some results on the total (zero) forcing number of a graph No 1, 22 pages

Jianxi Li, Dongxin Tu and Wai Chee Shiu

Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks No 10, 25 pages

Qing Zhao, Zhen Li, Jianqiang Li, Jianxiong Guo, Xingjian Ding and Deying Li

A sharp upper bound for the edge dominating number of hypergraphs with minimum degree No 11, 16 pages

Zhongzheng Tang and Zhuo Diao

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems No 12, 19 pages

Pengxiang Pan, Junran Lichen, Ping Yang and Jianping Li

Approximation algorithm for dynamic facility location problem No 13, 15 pages

Li Zhang and Qiaoliang Li

An improved approximation algorithm for covering vertices by $$4^+$$ 4 + -paths No 14, 29 pages

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin and Lusheng Wang

Link fault tolerability of the Cartesian product power graph $$(K_{9}-C_{9})^{n}$$ ( K 9 - C 9 ) n: conditional edge-connectivities under six link fault patterns No 15, 20 pages

Zhaoman Huang, Yayu Yang, Mingzu Zhang and Weihua Yang

Testing Higher-order Clusterability on Graphs No 16, 21 pages

Yifei Li, Donghua Yang and Jianzhong Li

On the parenthesisations of matrix chains: All are useful, few are essential No 17, 18 pages

Francisco López, Lars Karlsson and Paolo Bientinesi

Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs No 18, 49 pages

Tesshu Hanaka, Airi Ikeyama and Hirotaka Ono

Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components No 2, 26 pages

Na Li, Ran Ma and Yuzhong Zhang

Inefficiency of multiplicative approximate Nash equilibrium for scheduling games No 3, 21 pages

Zhuyinan Wang, Chen Zhang and Zhiyi Tan

Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints No 4, 22 pages

Minqin Liu, Wei Yu, Zhaohui Liu and Xinmeng Guo

Steiner trees with infinitely many terminals on the sides of an angle No 5, 28 pages

Danila Cherkashin, Emanuele Paolini and Yana Teplitskaya

Superposed semi-Markov decision process with application to optimal maintenance systems No 6, 19 pages

Jianmin Shi

Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem No 7, 29 pages

Xiyang Liu and Fangjun Luan

Mathematical models for the one-dimensional cutting stock problem with setups and open stacks No 8, 35 pages

Gabriel Gazzinelli Guimarães, Kelly Cristina Poldi and Mateus Martin

Guaranteeing fairness and efficiency under budget constraints No 9, 21 pages

Yuanyuan Wang, Xin Chen, Qizhi Fang, Qingqin Nong and Wenjing Liu

2025, volume 49, articles 2

Social media actors: perception and optimization of influence across different types No 1, 39 pages

Alexander A. Kharlamov, Aleksey N. Raskhodchikov and Maria Pilgun

Embedded-filter ACO using clustering based mutual information for feature selection No 10, 30 pages

S. Kumar Reddy Mallidi and Rajeswara Rao Ramisetty

Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate No 11, 22 pages

Zhanbing Guo and Yejie Zhang

An $$L_2$$ L 2 regularization reduced quadratic surface support vector machine model No 12, 28 pages

Jiguang Wang, Fangfang Guo and Jie Shen

The edge-vertex domination and weighted edge-vertex domination problem No 13, 9 pages

Peng Li, Xinyi Xue and Xingli Zhou

The minimum orientable genus of the repeated Cartesian product of graphs No 14, 13 pages

Marietta Galea and John Baptist Gauci

Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties No 15, 27 pages

Zhichao Geng and Lingfa Lu

Improved lower bound for estimating the number of defective items No 16, 19 pages

Nader H. Bshouty

Energy-efficient real-time multi-workflow scheduling in container-based cloud No 17, 21 pages

Zaixing Sun, Hejiao Huang, Zhikai Li and Chonglin Gu

Enhancing decision-making in cloud service provider selection using probabilistic p, q-rung orthopair fuzzy model No 18, 44 pages

Pairote Yiarayong

Recognizing integrality of weighted rectangles partitions No 2, 15 pages

Paul Deuker and Ulf Friedrich

An improved PTAS for covering targets with mobile sensors No 3, 22 pages

Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo and Jittat Fakcharoenphol

Degree and betweenness-based label propagation for community detection No 4, 18 pages

Qiufen Ni, Jun Wang and Zhongzheng Tang

The undirected optical indices of trees No 5, 22 pages

Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang and Wing Shing Wong

$$(K_{1}\vee {P_{t})}$$ ( K 1 ∨ P t ) -saturated graphs with minimum number of edges No 6, 15 pages

Jinze Hu, Shengjin Ji and Qing Cui

Agent-constrained truthful facility location games No 7, 24 pages

Argyrios Deligkas, Mohammad Lotfi and Alexandros A. Voudouris

Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model No 8, 35 pages

Chenhao Wang, Yao Wang and Shaojie Tang

A fuzzy approach for the intuitionistic multi-objective linear fractional programming problem using a bisection method No 9, 24 pages

Nurdan Kara, Hale Gonce Kocken and Hande Günay Akdemir

2025, volume 49, articles 1

A novel arctic fox survival strategy inspired optimization algorithm No 1, 73 pages

E. Subha, V. Jothi Prakash and S. Arul Antran Vijay

Np-completeness and bounds for disjunctive total domination subdivision No 10, 10 pages

Canan Çiftçi and Aysun Aytaç

Facial expression-based emotion recognition across diverse age groups: a multi-scale vision transformer with contrastive learning approach No 11, 39 pages

G. Balachandran, S. Ranjith, T. R. Chenthil and G. C. Jagan

Online multiple one way non-preemptive time series search with interrelated prices No 12, 21 pages

Jinghan Zhao, Yongxi Cheng, Jan Eube and Haodong Liu

Spectral influence in networks: an application to input-output analysis No 13, 43 pages

Nizar Riane

Discrete circles: analytical definition and generation in the hexagonal grid No 14, 23 pages

Rita Zrour, Lidija Čomić, Eric Andres and Gaëlle Largeteau Skapin

Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners No 15, 27 pages

Mohsen Alambardar Meybodi, Amir Goharshady, Mohammad Reza Hooshmandasl and Ali Shakiba

Lollipop and cubic weight functions for graph pebbling No 16, 17 pages

Marshall Yang, Carl Yerger and Runtian Zhou

Optimal dispatching of electric vehicles based on optimized deep learning in IoT No 17, 28 pages

V. Agalya, M. Muthuvinayagam and R. Gandhi

Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity No 2, 14 pages

Canh V. Pham

Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks No 3, 18 pages

Qie Li, Zichen Wang and Hongwei Du

New bounds on the price of anarchy of selfish bin packing with partial punishment No 4, 17 pages

Xiaowei Li, Peihai Liu and Xiwen Lu

Customer segmentation using flying fox optimization algorithm No 5, 20 pages

Konstantinos Zervoudakis and Stelios Tsafarakis

Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan No 6, 17 pages

Han Zhang, Lingfa Lu and Jinjiang Yuan

Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback No 7, 25 pages

Xin Sun, Tiande Guo, Congying Han and Hongyang Zhang

Approximation algorithms for the airport and railway problem No 8, 33 pages

Mohammad R. Salavatipour and Lijiangnan Tian

A study on $$k$$ k - $$walk$$ walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms No 9, 15 pages

SeongCheol Yoon, Daehee Seo, Su-Hyun Kim and Im-Yeong Lee