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

Preface: Combinatorial optimization drives the future of Health Care pp. 675-676

Liwei Zhong and Guochun Tang

Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization pp. 677-699

Xuanzhu Fan, Jiafu Tang, Chongjun Yan, Hainan Guo and Zhongfa Cao

Medical rolling bearing fault prognostics based on improved extreme learning machine pp. 700-721

Cheng He, Changchun Liu, Tao Wu, Ying Xu, Yang Wu and Tong Chen

Medical consumable usage control based on Canopy_K-means clustering and WARM pp. 722-739

Ying Yang, Huijing Wu and Caixia Yan

The new treatment mode research of hepatitis B based on ant colony algorithm pp. 740-759

Jing Yu, Lining Xing and Xu Tan

A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$ L 2 - L p regularization for application of magnetic resonance brain images pp. 760-784

Xuerui Gao, Yanqin Bai and Qian Li

A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design pp. 785-812

Zhiguo Wang, Lufei Huang and Cici Xiao He

Improved gray neural network model for healthcare waste recycling forecasting pp. 813-830

Hao Hao, Ji Zhang, Qian Zhang, Li Yao and Yichen Sun

An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction pp. 831-847

Qian Li and Wei Zhang

Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example pp. 848-865

Huidan Lin, Qun Li, Xueguo Xu and Ying Zhang

Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode pp. 866-883

Gengjun Gao, Yuxuan Che and Jian Shen

An intelligent data-driven model for disease diagnosis based on machine learning theory pp. 884-895

He Huang, Wei Gao and Chunming Ye

A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital pp. 896-908

Jing Fan and Hui Shi

Early warning of venous thromboembolism after surgery based on self-organizing competitive network pp. 909-927

Shi Yin, Jian Chang, Hailan Pan, Haizhou Mao and Mei Wang

Three-sided matching problem with mixed preferences pp. 928-936

Feng Zhang and Liwei Zhong

Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm pp. 937-947

Zhihong Zhao, Beibei Li and Jun Liu

A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis pp. 948-965

Xin Yan, Hongmiao Zhu and Jian Luo

Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network pp. 966-987

Gang Du, Xi Liang, Xiaoling Ouyang and Chunming Wang

Research on model and algorithm of TCM constitution identification based on artificial intelligence pp. 988-1003

Bin Li, Qianghua Wei and Xinye Zhou

Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming pp. 1004-1029

Ling Gai, Zhiyue Peng, Jiming Zhang and Jiafu Zhang

Perceived service quality’s effect on patient loyalty through patient attitude within the context of traditional Chinese medicine pp. 1030-1041

Hongbo Li, Li Wang, Xuan Xia and Hongbo Liu

Research of SVM ensembles in medical examination scheduling pp. 1042-1052

Yi Du, Hua Yu and Zhijun Li

An optimized approach of venous thrombus embolism risk assessment pp. 1053-1063

Ruiping Wang, Mei Wang, Jian Chang, Zai Luo, Feng Zhang and Chen Huang

2021, volume 42, articles 3

Preface: special issue on the annual international conference on combinatorial optimization and applications (COCOA) pp. 339-339

Xiaofeng Gao

Conflict-free connection of trees pp. 340-353

Hong Chang, Meng Ji, Xueliang Li and Jingshu Zhang

On the complexity and approximability of repair position selection problem pp. 354-372

Xianmin Liu, Yingshu Li, Jianzhong Li and Yuqiang Feng

A spectral partitioning algorithm for maximum directed cut problem pp. 373-395

Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu and Dongmei Zhang

On the complexity of and algorithms for detecting k-length negative cost cycles pp. 396-408

Longkun Guo and Peng Li

A dynamic approach to detecting, eliminating and fixing memory leaks pp. 409-426

Bin Yu, Cong Tian, Nan Zhang, Zhenhua Duan and Hongwei Du

Mixed connectivity properties of random graphs and some special graphs pp. 427-441

Ran Gu, Yongtang Shi and Neng Fan

The one-cop-moves game on planar graphs pp. 442-475

Ziyuan Gao and Boting Yang

Tropical paths in vertex-colored graphs pp. 476-498

Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang and Hong Phong Pham

Algorithms for the metric ring star problem with fixed edge-cost ratio pp. 499-523

Xujin Chen, Xiaodong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang and Ying Zhang

An improved algorithm for the $$(n, 3)$$ ( n, 3 ) -MaxSAT problem: asking branchings to satisfy the clauses pp. 524-542

Chao Xu, Wenjun Li, Jianxin Wang and Yongjie Yang

Batch scheduling of nonidentical job sizes with minsum criteria pp. 543-564

Rongqi Li, Zhiyi Tan and Qianyu Zhu

Improved algorithms for single vehicle scheduling on tree/cycle networks pp. 565-580

Yuanxiao Wu and Xiwen Lu

The spectral radius and domination number in linear uniform hypergraphs pp. 581-592

Liying Kang, Wei Zhang and Erfang Shan

Big data driven urban railway planning: Shenzhen metro case study pp. 593-615

Wen Xu, Caiwei Yuan, Keke Peng and Hongwei Du

On the price of anarchy of two-stage machine scheduling games pp. 616-635

Deshi Ye, Lin Chen and Guochuan Zhang

An improved mechanism for selfish bin packing pp. 636-656

Xin Chen, Qingqin Nong and Qizhi Fang

Modified Greedy Heuristic for the one-dimensional cutting stock problem pp. 657-674

Gonçalo R. L. Cerqueira, Sérgio S. Aguiar and Marlos Marques

2021, volume 42, articles 2

Theory and applications in combinatorial optimization pp. 207-211

John Baptist Gauci and Silvano Martello

Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search pp. 212-230

Andrei Nikolaev and Anna Kozlova

Sublinear search spaces for shortest path planning in grid and road networks pp. 231-257

Johannes Blum, Stefan Funke and Sabine Storandt

The principal eigenvector to $$\alpha $$ α -spectral radius of hypergraphs pp. 258-275

Jing Wang, Liying Kang and Erfang Shan

A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements pp. 276-309

Yakov Zinder, Alexandr Kononov and Joey Fung

Nullspace vertex partition in graphs pp. 310-326

Irene Sciriha, Xandru Mifsud and James L. Borg

A note on the single machine CON and CONW problems with lot scheduling pp. 327-338

Baruch Mor and Gur Mosheiov

2021, volume 42, articles 1

Efficient feature selection for logical analysis of large-scale multi-class datasets pp. 1-23

Kedong Yan, Dongjing Miao, Cui Guo and Chanying Huang

(Strong) Total proper connection of some digraphs pp. 24-39

Yingbin Ma and Kairui Nie

Complexity results for two kinds of colored disconnections of graphs pp. 40-55

You Chen, Ping Li, Xueliang Li and Yindi Weng

Algorithmic aspects of 2-secure domination in graphs pp. 56-70

Pavan Kumar Jakkepalli and Venkata Subba Reddy Palagiri

A 3/2-approximation for big two-bar charts packing pp. 71-84

Adil Erzin, Georgii Melidi, Stepan Nazarenko and Roman Plotnikov

Declawing a graph: polyhedra and Branch-and-Cut algorithms pp. 85-124

Felipe C. Fragoso, Gilberto F. Sousa Filho and Fábio Protti

A unifying model for locally constrained spanning tree problems pp. 125-150

Luiz Viana, Manoel Campêlo, Ignasi Sau and Ana Silva

Suboptimal sliding manifold For nonlinear supply chain with time delay pp. 151-173

Sajjad Aslani Khiavi, Hamid Khaloozadeh and Fahimeh Soltanian

Roman {k}-domination in trees and complexity results for some classes of graphs pp. 174-186

Cai-Xia Wang, Yu Yang, Hong-Juan Wang and Shou-Jun Xu

Efficient algorithms for support path with time constraint pp. 187-205

Lili Zhang, Cheng-Kuan Lin, Xiaoqiang Chen, Jianxi Fan and Yuan-Hsiang Teng