|
|
|
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 5
- Optimizing energy efficiency in WSNs through dynamic sensor deployment and advanced clustering No 1, 23 pages

- Dinesh Sharma and Geetam Singh Tomar
- Bond polytope under vertex- and edge-sums No 2, 21 pages

- Petr Kolman and Hans Raj Tiwary
- The approximation algorithm and fast algorithm for constrained or-submodular maximization problem No 3, 18 pages

- Haifeng Huang, Qian Liu, Yang Zhou and Min Li
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs No 4, 18 pages

- Banu Baklan Şen, Thomas Erlebach and Öznur Yaşar
- Approximation algorithms for the minimum weight cycle/path partition problem No 5, 29 pages

- Yaqi Li, Wei Yu and Zhaohui Liu
- Approximation algorithms for the Square Min-Sum Bin Packing Problem No 6, 22 pages

- Rachel Vanucchi Saraiva and Rafael C. S. Schouery
- Improved lower bounds on the general reduced second Zagreb index of trees and unicyclic graphs No 7, 18 pages

- Nasrin Dehgardi, Sandi Klavžar and Mahdieh Azari
- Efficient exact algorithms for multi-Machine non-idling unit-job scheduling No 8, 34 pages

- Philippe Chretienne, Alain Quilliot and Hélène Toussaint
2026, volume 51, articles 4
- Recent advances in combinatorial optimization No 1, 5 pages

- Silvano Martello and Nikolaos Matsatsinis
- Information-theoretic coordinate subset and partition selection of multivariate Markov chains via submodular optimization No 2, 57 pages

- Zheyuan Lai and Michael C. H. Choi
- IoT botnet attack detection using ensemble classifiers with optimal training No 3, 32 pages

- Shankar Vuppu, V. Chandra Shekhar Rao, M. Sujatha, Shaik Munawar, S. Nagaraju and N. Gayatri
- Hamiltonian paths extending a set of matchings in hypercubes No 4, 23 pages

- Abid Ali, Lina Ba and Weihua Yang
2026, volume 51, articles 3
- Single Machine Scheduling with Precedence Constraints and Bounded Maximum Delay Value No 1, 32 pages

- Maher Mallem, Claire Hanen and Alix Munier-Kordon
- Chaotic strategies-enhanced artificial electric field algorithm for combinatorial feature selection No 2, 48 pages

- Dikshit Chauhan, Deepika Khurana and Anupam Yadav
- Competition between healthcare providers under subscription and fee-for-service: an equilibrium analysis of health information exchange system’s choice No 3, 43 pages

- Zhaofang Mao, Yuqiong Jiang and Yufeng Liao
- Homological invariants of edge ideals of Wollastonite graphs No 4, 22 pages

- Bilal Ahmad Rather
- DP color functions of hypergraphs No 5, 14 pages

- Ruiyi Cui, Liangxia Wan and Fengming Dong
- On the Genus of Cartesian products of complete graph $$K_{12t+7}$$ K 12 t + 7 with cycles and paths No 6, 17 pages

- Jyoti Anant Pulgam and Prashant Malavadkar
- Improving order with queues No 7, 29 pages

- Andreas Karrenbauer, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek, Alireza Haqi and Siavash Rahimi Shateranloo
2026, volume 51, articles 2
- PTAS for Euclidean travelling salesman problem with soft time windows No 1, 23 pages

- Liang Song, Songsong Wu, Yongxuan Lai, Chunyan Liu, Hejiao Huang and Hongwei Du
- A systematic review of recent advances in snake optimizer algorithm No 10, 37 pages

- Moh Nur Sholeh and Undayani Cita Sari
- (Pareto)-Optimization and greedy algorithm-based solutions for review and panel assignments No 11, 38 pages

- Rohit Ramachandran, Urjit Patil and Abhinav De
- A Modified non-monotone adaptive retrospective trust region algorithm for unconstrained optimization No 12, 35 pages

- Seyed Hamzeh Mirzaei and Ali Ashrafi
- The complexity of distance-r dominating set reconfiguration No 13, 36 pages

- Niranka Banerjee and Duc A. Hoang
- Maximum alternating clean balanced cycle decomposition and applications in rearrangement distance problems No 14, 31 pages

- Gabriel Siqueira, Klairton Lima Brito, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias and Zanoni Dias
- A multimodal meta-learning-augmented EmoTriSense for emotion recognition No 15, 40 pages

- V. Sowmya and A. Rajeswari
- Optimal due date assignment in a single machine group technology scheduling environment with learning effect No 16, 26 pages

- Ying Chen, Yongxi Cheng, Jun Wu and Guiqing Zhang
- Federated edge intelligence for secure and adaptive routing in IoT: a GRU–RL based framework No 17, 28 pages

- Wajih Abdallah
- Online dispatching and routing for automated guided vehicles in pickup and delivery systems on loop-based graphs No 18, 25 pages

- Louis Stubbe, Jens Goemaere and Jan Goedgebeur
- On the enumeration of resolute majority rules No 19, 28 pages

- Josep Freixas and Dani Samaniego
- Output-sensitive complexity of multi-objective integer network flow problems No 2, 30 pages

- David Könen and Michael Stiglmayr
- Binary jumbled indexing: suffix tree histogram No 20, 17 pages

- Luís Cunha and Mário Medina
- A note between transitive $$C_4$$ C 4 -factor and oriented Ramsey number No 3, 10 pages

- Ming Chen, Zhengke Miao and Shan Zhou
- Stable matching with approval preferences under partial information No 4, 21 pages

- Yaqin Chu, Junjie Luo and Tianyang Zheng
- On positive influence dominating sets with bi-directional weighted constraint in social networks No 5, 8 pages

- Qi Zhang and Hao Zhong
- On maximizing k-submodular functions under p-system and d-knapsack constraints No 6, 23 pages

- Wenzhe Zhang, Shufang Gong, Bin Liu, Qian Liu and Priyanshi Garg
- A fault-tolerant dynamic graph attention network for energy efficient routing and reliability in wireless sensor networks No 7, 38 pages

- G. V. Soni Meera and R. Isaac Sajan
- Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs No 8, 30 pages

- Fenghe Xia, Longkun Guo and Xiaoyan Zhang
- The TWKHM conjecture on the number of walks in trees No 9, 20 pages

- Dongxiu Cai, Jiasheng Zeng and Xiao-Dong Zhang
2026, volume 51, articles 1
- Strong edge-coloring of graphs with maximum edge weight seven No 1, 11 pages

- Runze Wang
- Hytranet: a deep learning model for traffic congestion prediction in road networks No 10, 22 pages

- Manoj Kumar and Kranti Kumar
- On the transmission irregular trees with the maximum Wiener index No 11, 27 pages

- Ivan Damnjanović, Anran Xu and Kexiang Xu
- Publisher Correction: Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs No 12, 3 pages

- Guantao Chen, Guangming Jing and Wenan Zang
- Constructing the antimagic labelings for double stars union paths on three vertices No 2, 17 pages

- Wei-Tian Li and Po-Wen Yang
- An integer model for optimizing dynamic allocation of medical supplies during the COVID-19 No 3, 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 4, 26 pages

- Patrick De Causmaecker and Lennart Van Hirtum
- Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint No 5, 23 pages

- Tan D. Tran and Canh V. Pham
- Distributionally robust one-class support vector machine for anomaly detection under uncertainty No 6, 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 7, 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 8, 17 pages

- Byung-Cheon Choi and Myoung-Ju Park
- Structured query language injection attack detection via giant magnificent frigatebird optimization and federated learning No 9, 38 pages

- Madhavi Perla and Valli Kumari Vatsavayi
|
On this page- 2026, volume 51
-
Articles 5
Articles 4 Articles 3 Articles 2 Articles 1
Other years 2025, volume 50
2025, volume 49
2024, volume 48
2024, volume 47
2023, volume 46
2023, volume 45
2022, volume 44
2022, volume 43
2021, volume 42
2021, volume 41
2020, volume 40
2020, volume 39
2019, volume 38
2019, volume 37
2018, volume 36
2018, volume 35
2017, volume 34
2017, volume 33
2016, volume 32
2016, volume 31
2015, volume 30
2015, volume 29
2014, volume 28
2014, volume 27
2013, volume 26
2013, volume 25
2012, volume 24
2012, volume 23
2011, volume 22
2011, volume 21
2010, volume 20
2010, volume 19
2009, volume 18
2009, volume 17
2008, volume 16
2008, volume 15
2007, volume 14
2007, volume 13
2006, volume 12
2006, volume 11
2005, volume 10
2005, volume 9
2004, volume 8
2003, volume 7
2002, volume 6
2001, volume 5
2000, volume 4
1999, volume 3
1998, volume 2
1998, volume 1
1997, volume 1
Undated
|
On this page- 2026, volume 51
-
Articles 5
Articles 4 Articles 3 Articles 2 Articles 1
Other years 2025, volume 50
2025, volume 49
2024, volume 48
2024, volume 47
2023, volume 46
2023, volume 45
2022, volume 44
2022, volume 43
2021, volume 42
2021, volume 41
2020, volume 40
2020, volume 39
2019, volume 38
2019, volume 37
2018, volume 36
2018, volume 35
2017, volume 34
2017, volume 33
2016, volume 32
2016, volume 31
2015, volume 30
2015, volume 29
2014, volume 28
2014, volume 27
2013, volume 26
2013, volume 25
2012, volume 24
2012, volume 23
2011, volume 22
2011, volume 21
2010, volume 20
2010, volume 19
2009, volume 18
2009, volume 17
2008, volume 16
2008, volume 15
2007, volume 14
2007, volume 13
2006, volume 12
2006, volume 11
2005, volume 10
2005, volume 9
2004, volume 8
2003, volume 7
2002, volume 6
2001, volume 5
2000, volume 4
1999, volume 3
1998, volume 2
1998, volume 1
1997, volume 1
Undated
|
|