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

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

2024, volume 48, articles 5

Minimum $$ s-t $$ s - t hypercut in (s, t)-planar hypergraphs No 1, 22 pages

Abolfazl Hassanpour, Massoud Aman and Alireza Ebrahimi

Maximizing diversity and persuasiveness of opinion articles in social networks No 2, 44 pages

Liman Du, Wenguo Yang and Suixiang Gao

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees No 3, 30 pages

Xiao Li, Xiucui Guan, Qiao Zhang, Xinyi Yin and Panos M. Pardalos

Non-submodular maximization with a decomposable objective function No 4, 20 pages

Cheng Lu and Wenguo Yang

On injective chromatic index of sparse graphs with maximum degree 5 No 5, 11 pages

Jian Lu, Zhen-Mu Hong and Zheng-Jiang Xia

Dynamic time window based full-view coverage maximization in CSNs No 6, 18 pages

Jingfang Su, Zeqing Li, Hongwei Du and Shengxin Liu

Different due-window assignment scheduling with deterioration effects No 7, 21 pages

Yurong Zhang, Xi Wang, Li-Han Zhang, Xue Jia and Ji-Bo Wang

An upper bound for neighbor-connectivity of graphs No 8, 14 pages

Hongliang Ma and Baoyindureng Wu

2024, volume 48, articles 4

New approximations for monotone submodular maximization with knapsack constraint No 1, 7 pages

Hongmin W. Du, Xiang Li and Guanghua Wang

Explicit construction of mixed dominating sets in generalized Petersen graphs No 2, 22 pages

Meysam Rajaati Bavil Olyaei, Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl and Ali Shakiba

Efficient heuristics to compute minimal and stable feedback arc sets No 3, 24 pages

Claudia Cavallaro, Vincenzo Cutello and Mario Pavone

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs No 4, 48 pages

Rahnuma Islam Nishat, Venkatesh Srinivasan and Sue Whitesides

Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement No 5, 20 pages

Haiyue Yu, Ting Shen and Liwei Zhong

A MILP model for the connected multidimensional maximum bisection problem No 6, 17 pages

Zoran Lj. Maksimović

Algorithms for the bin packing problem with scenarios No 7, 28 pages

Yulle G. F. Borges, Vinícius L. Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. Queiroz and Rafael C. S. Schouery

On greedy approximation algorithm for the minimum resolving dominating set problem No 8, 8 pages

Hao Zhong

Fashion game on graphs with more than two actions No 9, 18 pages

Qi Wang and Wensong Lin

2024, volume 48, articles 3

Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs No 1, 27 pages

Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz and Frank Sommer

Algorithmic study on liar’s vertex-edge domination problem No 10, 18 pages

Debojyoti Bhattacharya and Subhabrata Paul

W-prize-collecting scheduling problem on parallel machines No 11, 9 pages

Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu and Wen Liu

Approximate weak efficiency of the set-valued optimization problem with variable ordering structures No 12, 13 pages

Zhiang Zhou, Wenbin Wei, Fei Huang and Kequan Zhao

The k-th Roman domination problem is polynomial on interval graphs No 2, 14 pages

Peng Li

Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges No 3, 22 pages

Yuya Higashikawa, Naoki Katoh, Junichi Teruyama and Yuki Tokuni

Matroid-rooted packing of arborescences No 4, 17 pages

Zoltán Szigeti

Approximation algorithm for prize-collecting vertex cover with fairness constraints No 5, 18 pages

Mingchao Zhou, Zhao Zhang and Ding-Zhu Du

Approximation algorithms for solving the trip-constrained vehicle routing cover problems No 6, 24 pages

Jianping Li, Ping Yang, Junran Lichen and Pengxiang Pan

Construction of floorplans for plane graphs over polygonal boundaries No 7, 25 pages

Rohit Lohani and Krishnendra Shekhawat

Minimizing the maximum lateness for scheduling with release times and job rejection No 8, 22 pages

Imed Kacem and Hans Kellerer

A common generalization of budget games and congestion games No 9, 18 pages

Fuga Kiyosue and Kenjiro Takazawa

2024, volume 48, articles 2

The prize-collecting single machine scheduling with bounds and penalties No 1, 13 pages

Guojun Hu, Pengxiang Pan, Suding Liu, Ping Yang and Runtao Xie

Meta-heuristic-based hybrid deep learning model for vulnerability detection and prevention in software system No 2, 21 pages

Lijin Shaji and R. Suji Pramila

Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs No 3, 36 pages

Vladyslav Oles, Nathan Lemons and Alexander Panchenko

Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights No 4, 20 pages

Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama and Yuki Tokuni

2024, volume 48, articles 1

Embedding and the first Laplace eigenvalue of a finite graph No 1, 24 pages

Takumi Gomyou, Toshimasa Kobayashi, Takefumi Kondo and Shin Nayatani

On the complexity of minimum maximal acyclic matchings No 10, 23 pages

Juhi Chaudhary, Sounaka Mishra and B. S. Panda

Polynomial algorithms for sparse spanners on subcubic graphs No 11, 21 pages

R. Gómez, F. K. Miyazawa and Y. Wakababayashi

Risk-adjusted exponential gradient strategies for online portfolio selection No 2, 25 pages

Jin’an He, Fangping Peng and Xiuying Xie

Maximizing stochastic set function under a matroid constraint from decomposition No 3, 21 pages

Shengminjie Chen, Donglei Du, Wenguo Yang and Suixiang Gao

An improved upper bound for the online graph exploration problem on unicyclic graphs No 4, 38 pages

Koji M. Kobayashi and Ying Li

First zagreb spectral radius of unicyclic graphs and trees No 5, 24 pages

Parikshit Das, Kinkar Chandra Das, Sourav Mondal and Anita Pal

Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents No 6, 17 pages

Qi-Xia Yang, Long-Cheng Liu, Min Huang and Tian-Run Wang

Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets No 7, 31 pages

Fatemeh Ehsani and Monireh Hosseini

Models for two-dimensional bin packing problems with customer order spread No 8, 27 pages

Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos and Reinaldo Morabito

Approximating the probabilistic p-Center problem under pressure No 9, 25 pages

Marc Demange, Marcel A. Haddad and Cécile Murat