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.

2021, volume 41, articles 4

Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty pp. 781-793

Byung-Cheon Choi and Myoung-Ju Park

A metaheuristic for the delivery man problem with time windows pp. 794-816

Ha-Bang Ban

On the relation between Wiener index and eccentricity of a graph pp. 817-829

Hamid Darabi, Yaser Alizadeh, Sandi Klavžar and Kinkar Chandra Das

Single-machine online scheduling of jobs with non-delayed processing constraint pp. 830-843

Wenjie Li and Jinjiang Yuan

The m-Steiner Traveling Salesman Problem with online edge blockages pp. 844-860

Henan Liu, Huili Zhang and Yi Xu

Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance pp. 861-887

Hui Wang, Xiucui Guan, Qiao Zhang and Binwu Zhang

An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties pp. 888-904

Wei Lv and Chenchen Wu

A continuous generalization of domination-like invariants pp. 905-922

Michitaka Furuya

Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs pp. 923-933

Ke Liu and Mei Lu

2021, volume 41, articles 3

Length-weighted $$\lambda $$ λ -rearrangement distance pp. 579-602

Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer and Zanoni Dias

Minimum constellation covers: hardness, approximability and polynomial cases pp. 603-624

Santiago Valdés Ravelo

The simple grid polygon exploration problem pp. 625-639

Qi Wei, Jie Sun, Xuehou Tan, Xiaolin Yao and Yonggong Ren

Designing emergency flood evacuation plans using robust optimization and artificial intelligence pp. 640-677

Soheyl Khalilpourazari and Seyed Hamid Reza Pasandideh

Some mixed graphs with H-rank 4, 6 or 8 pp. 678-693

Jinling Yang, Ligong Wang and Xiuwen Yang

On maximum $$P_3$$ P 3 -packing in claw-free subcubic graphs pp. 694-709

Wenying Xi and Wensong Lin

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation pp. 710-735

Tınaz Ekim, Mordechai Shalom and Oylum Şeker

On the computational complexity of finding a sparse Wasserstein barycenter pp. 736-761

Steffen Borgwardt and Stephan Patterson

Digraphs that contain at most t distinct walks of a given length with the same endpoints pp. 762-779

Zhenhua Lyu

2021, volume 41, articles 2

Application of multi-objective optimization algorithm for siting and sizing of distributed generations in distribution networks pp. 267-289

J. Rajalakshmi and S. Durairaj

Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times pp. 290-303

Ji-Bo Wang, Bo Cui, Ping Ji and Wei-Wei Liu

Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination pp. 304-317

Abolfazl Poureidi, Mehrdad Ghaznavi and Jafar Fathali

Differentially private approximate aggregation based on feature selection pp. 318-327

Zaobo He, Akshita Maradapu Vera Venkata Sai, Yan Huang, Daehee Seo, Hanzhou Zhang and Qilong Han

Group level social media popularity prediction by MRGB and Adam optimization pp. 328-347

Navdeep Bohra and Vishal Bhatnagar

On strict submodularity of social influence pp. 348-356

Qiufen Ni and Hongwei Du

Application of optimization methods in the closed-loop supply chain: a literature review pp. 357-400

Luttiely Santos Oliveira and Ricardo Luiz Machado

Secure domination in rooted product graphs pp. 401-413

Rangel Hernández-Ortiz, Luis Pedro Montejano and Juan Alberto Rodríguez-Velázquez

Dominating set of rectangles intersecting a straight line pp. 414-432

Supantha Pandit

Approximation algorithm for the multicovering problem pp. 433-450

Abbass Gorgi, Mourad El Ouali, Anand Srivastav and Mohamed Hachimi

Bounds on the semipaired domination number of graphs with minimum degree at least two pp. 451-486

Teresa W. Haynes and Michael A. Henning

On sufficient topological indices conditions for properties of graphs pp. 487-503

Yong Lu and Qiannan Zhou

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work pp. 504-525

Ruyan He, Jinjiang Yuan, C. T. Ng and T. C. E. Cheng

Italian domination in the Cartesian product of paths pp. 526-543

Hong Gao, Tingting Feng and Yuansheng Yang

The balanced double star has maximum exponential second Zagreb index pp. 544-552

Roberto Cruz, Juan Daniel Monsalve and Juan Rada

Zero forcing versus domination in cubic graphs pp. 553-577

Randy Davila and Michael A. Henning

2021, volume 41, articles 1

Single machine lot scheduling with optional job-rejection pp. 1-11

Baruch Mor, Gur Mosheiov and Dana Shapira

A randomized approximation algorithm for metric triangle packing pp. 12-27

Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang and An Zhang

Improved approximation algorithms for two-stage flexible flow shop scheduling pp. 28-42

Anzhen Peng, Longcheng Liu and Weifeng Lin

Sequence submodular maximization meets streaming pp. 43-55

Ruiqi Yang, Dachuan Xu, Longkun Guo and Dongmei Zhang

Secure Italian domination in graphs pp. 56-72

M. Dettlaff, M. Lemańska and J. A. Rodríguez-Velázquez

Quaternary splitting algorithm in group testing pp. 73-79

Jinn Lu and Hung-Lin Fu

Top-k overlapping densest subgraphs: approximation algorithms and computational complexity pp. 80-104

Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri and Italo Zoppis

The t-latency bounded strong target set selection problem in some kinds of special family of graphs pp. 105-117

Xianliang Liu, Zishen Yang and Wei Wang

A greedy algorithm for the fault-tolerant outer-connected dominating set problem pp. 118-127

Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu and Suogang Gao

Non-monotone submodular function maximization under k-system constraint pp. 128-142

Majun Shi, Zishen Yang, Donghyun Kim and Wei Wang

A scenario-based robust optimization with a pessimistic approach for nurse rostering problem pp. 143-169

Mohammad Reza Hassani and J. Behnamian

On multi-path routing for reliable communications in failure interdependent complex networks pp. 170-196

Zishen Yang, Wei Wang and Donghyun Kim

New construction of error-correcting pooling designs from singular linear spaces over finite fields pp. 197-212

Gang Wang and You Gao

Discount allocation for cost minimization in online social networks pp. 213-233

Qiufen Ni, Smita Ghosh, Chuanhe Huang, Weili Wu and Rong Jin

On characterizations for subclasses of directed co-graphs pp. 234-266

Frank Gurski, Dominique Komander and Carolin Rehs

2020, volume 40, articles 4

Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect pp. 861-868

Dexin Zou, Chong Jiang and Weiwei Liu

Connected max cut is polynomial for graphs without the excluded minor $$K_5\backslash e$$ K 5 \ e pp. 869-875

Brahim Chaourar

A characterization of optimal multiprocessor schedules and new dominance rules pp. 876-900

Rico Walter and Alexander Lawrinenko

A short proof for stronger version of DS decomposition in set function optimization pp. 901-906

Xiang Li and H. George Du

Influence maximization problem: properties and algorithms pp. 907-928

Wenguo Yang, Yapu Zhang and Ding-Zhu Du

New approximation algorithms for machine scheduling with rejection on single and parallel machine pp. 929-952

Peihai Liu and Xiwen Lu

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number pp. 953-973

Tomáš Vetrík and Selvaraj Balachandran

Online maximum matching with recourse pp. 974-1007

Spyros Angelopoulos, Christoph Dürr and Shendan Jin

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs pp. 1008-1019

Zhiwei Guo, Hajo Broersma, Ruonan Li and Shenggui Zhang

Intersecting families in $$\left( {\begin{array}{c}{[m]}\\ \ell \end{array}}\right) \cup \left( {\begin{array}{c}{[n]}\\ k\end{array}}\right) $$ [ m ] ℓ ∪ [ n ] k pp. 1020-1029

Jun Wang and Huajun Zhang

A linear time algorithm for the p-maxian problem on trees with distance constraint pp. 1030-1043

Trung Kien Nguyen, Nguyen Thanh Hung and Huong Nguyen-Thu

Minimizing maximum delivery completion time for order scheduling with rejection pp. 1044-1064

Ren-Xia Chen and Shi-Sheng Li

An approximation algorithm for submodular hitting set problem with linear penalties pp. 1065-1074

Shaojing Du, Suogang Gao, Bo Hou and Wen Liu

Partial inverse min–max spanning tree problem pp. 1075-1091

Javad Tayyebi and Ali Reza Sepasian

Maximizing user type diversity for task assignment in crowdsourcing pp. 1092-1120

Ana Wang, Meirui Ren, Hailong Ma, Lichen Zhang, Peng Li and Longjiang Guo

The maximum Wiener index of maximal planar graphs pp. 1121-1135

Debarun Ghosh, Ervin Győri, Addisu Paulos, Nika Salia and Oscar Zamora

2020, volume 40, articles 3

The complexity of total edge domination and some related results on trees pp. 571-589

Zhuo Pan, Yu Yang, Xianyue Li and Shou-Jun Xu

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation pp. 590-609

Pawan Aurora and Shashank K. Mehta

Selfish colorful bin packing games pp. 610-635

Vittorio Bilò, Francesco Cellinese, Giovanna Melideo and Gianpiero Monaco

A rapid learning automata-based approach for generalized minimum spanning tree problem pp. 636-659

Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi and Kamal Mirzaie

A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints pp. 660-696

Norelhouda Sekkal and Fayçal Belkaid

Average eccentricity, minimum degree and maximum degree in graphs pp. 697-712

P. Dankelmann and F. J. Osaye

Maximum weight induced matching in some subclasses of bipartite graphs pp. 713-732

B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane and Manav Kashyap

Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering pp. 733-756

Shuangyao Zhao, Qiang Zhang, Zhanglin Peng and Xiaonong Lu

Complexity and characterization aspects of edge-related domination for graphs pp. 757-773

Zhuo Pan, Xianyue Li and Shou-Jun Xu

Single machine batch scheduling with two non-disjoint agents and splitable jobs pp. 774-795

Zhichao Geng and Jiayu Liu

Bottleneck subset-type restricted matching problems pp. 796-805

Oleg Duginov

A $$(1.4 + \epsilon )$$ ( 1.4 + ϵ ) -approximation algorithm for the 2-Max-Duo problem pp. 806-824

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu and Peng Zhang

Boosting node activity by recommendations in social networks pp. 825-847

Wenguo Yang, Shengminjie Chen, Suixiang Gao and Ruidong Yan

Approximating the $$\tau $$ τ -relaxed soft capacitated facility location problem pp. 848-860

Lu Han, Dachuan Xu, Yicheng Xu and Dongmei Zhang

2020, volume 40, articles 2

Crossing minimization in perturbed drawings pp. 279-302

Radoslav Fulek and Csaba D. Tóth

A class of exponential neighbourhoods for the quadratic travelling salesman problem pp. 303-332

Brad D. Woods and Abraham P. Punnen

Coordination mechanisms for scheduling selfish jobs with favorite machines pp. 333-365

Cong Chen and Yinfeng Xu

Approximation algorithms for the selling with preference pp. 366-378

Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting and Yong Zhang

Searching and inferring colorful topological motifs in vertex-colored graphs pp. 379-411

Diego P. Rubert, Eloi Araujo, Marco A. Stefanes, Jens Stoye and Fábio V. Martinez

More on limited packings in graphs pp. 412-430

Xuqing Bai, Hong Chang and Xueliang Li

Integer linear programming formulations of the filter partitioning minimization problem pp. 431-453

Hazhar Rahmani and Jason M. O’Kane

The band collocation problem pp. 454-481

Hakan Kutucu, Arif Gursoy, Mehmet Kurt and Urfat Nuriyev

Power domination on triangular grids with triangular and hexagonal shape pp. 482-500

Prosenjit Bose, Valentin Gledel, Claire Pennarun and Sander Verdonschot

On the Roman domination subdivision number of a graph pp. 501-511

J. Amjadi, R. Khoeilar, M. Chellali and Z. Shao

On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering pp. 512-546

Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi and Anastasios Sidiropoulos

Multiprocessor open shop problem: literature review and future directions pp. 547-569

Zeynep Adak, Mahmure Övül Arıoğlu Akan and Serol Bulkan

2020, volume 40, articles 1

Plane graphs with $$\Delta =7$$Δ=7 are entirely 10-colorable pp. 1-20

Jiangxu Kong, Xiaoxue Hu and Yiqiao Wang

Approximating the asymmetric p-center problem in parameterized complete digraphs pp. 21-35

Wei Ding and Ke Qiu

A variation of DS decomposition in set function optimization pp. 36-44

Xiang Li, H. George Du and Panos M. Pardalos

Planar graphs without 4- and 6-cycles are (7: 2)-colorable pp. 45-58

Haitao Wu, Yaojun Chen and Xiaolan Hu

Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number pp. 59-68

Yan Liu, Mengxia Lei and Xueli Su

A $$\frac{5}{2}$$52-approximation algorithm for coloring rooted subtrees of a degree 3 tree pp. 69-97

Anuj Rawat and Mark Shayman

Secure domination of honeycomb networks pp. 98-109

M. R. Chithra and Manju K. Menon

Joint chance constrained shortest path problem with Copula theory pp. 110-140

Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar and Panos M. Pardalos

Classification optimization for training a large dataset with Naïve Bayes pp. 141-169

Thi Thanh Sang Nguyen and Pham Minh Thu Do

An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown pp. 170-180

Ji Tian, Yan Zhou and Ruyan Fu

New restrictions on defective coloring with applications to steinberg-type graphs pp. 181-204

Addie Armstrong and Nancy Eaton

KATZ centrality with biogeography-based optimization for influence maximization problem pp. 205-226

Abbas Salehi and Behrooz Masoumi

The strong chromatic index of graphs with edge weight eight pp. 227-233

Lily Chen, Shumei Chen, Ren Zhao and Xiangqian Zhou

Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem pp. 234-278

Fernando A. Morales and Jairo A. Martínez