default search action
Journal of Combinatorial Optimization, Volume 42
Volume 42, Number 1, July 2021
- Kedong Yan, Dongjing Miao, Cui Guo, Chanying Huang:
Efficient feature selection for logical analysis of large-scale multi-class datasets. 1-23 - Yingbin Ma, Kairui Nie:
(Strong) Total proper connection of some digraphs. 24-39 - You Chen, Ping Li, Xueliang Li, Yindi Weng:
Complexity results for two kinds of colored disconnections of graphs. 40-55 - Jakkepalli Pavan Kumar, Venkata Subba Reddy Palagiri:
Algorithmic aspects of 2-secure domination in graphs. 56-70 - Adil I. Erzin, Georgii Melidi, Stepan Nazarenko, Roman V. Plotnikov:
A 3/2-approximation for big two-bar charts packing. 71-84 - Felipe C. Fragoso, Gilberto Farias de Sousa Filho, Fábio Protti:
Declawing a graph: polyhedra and Branch-and-Cut algorithms. 85-124 - Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva:
A unifying model for locally constrained spanning tree problems. 125-150 - Sajjad Aslani Khiavi, Hamid Khaloozadeh, Fahimeh Soltanian:
Suboptimal sliding manifold For nonlinear supply chain with time delay. 151-173 - Cai-Xia Wang, Yu Yang, Hong-Juan Wang, Shou-Jun Xu:
Roman {k}-domination in trees and complexity results for some classes of graphs. 174-186 - Lili Zhang, Cheng-Kuan Lin, Xiaoqiang Chen, Jianxi Fan, Yuan-Hsiang Teng:
Efficient algorithms for support path with time constraint. 187-205
Volume 42, Number 2, August 2021
- John Baptist Gauci, Silvano Martello:
Theory and applications in combinatorial optimization. 207-211 - Andrei V. Nikolaev, Anna Kozlova:
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search. 212-230 - Johannes Blum, Stefan Funke, Sabine Storandt:
Sublinear search spaces for shortest path planning in grid and road networks. 231-257 - Jing Wang, Liying Kang, Erfang Shan:
The principal eigenvector to α-spectral radius of hypergraphs. 258-275 - Yakov Zinder, Alexandr V. Kononov, Joey Fung:
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. 276-309 - Irene Sciriha, Xandru Mifsud, James L. Borg:
Nullspace vertex partition in graphs. 310-326 - Baruch Mor, Gur Mosheiov:
A note on the single machine CON and CONW problems with lot scheduling. 327-338
Volume 42, Number 3, October 2021
- Xiaofeng Gao:
Preface: special issue on the annual international conference on combinatorial optimization and applications (COCOA). 339 - Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang:
Conflict-free connection of trees. 340-353 - Xianmin Liu, Yingshu Li, Jianzhong Li, Yuqiang Feng:
On the complexity and approximability of repair position selection problem. 354-372 - Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
A spectral partitioning algorithm for maximum directed cut problem. 373-395 - Longkun Guo, Peng Li:
On the complexity of and algorithms for detecting k-length negative cost cycles. 396-408 - Bin Yu, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du:
A dynamic approach to detecting, eliminating and fixing memory leaks. 409-426 - Ran Gu, Yongtang Shi, Neng Fan:
Mixed connectivity properties of random graphs and some special graphs. 427-441 - Ziyuan Gao, Boting Yang:
The one-cop-moves game on planar graphs. 442-475 - Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical paths in vertex-colored graphs. 476-498 - Xujin Chen, Xiao-Dong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang, Ying Zhang:
Algorithms for the metric ring star problem with fixed edge-cost ratio. 499-523 - Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang:
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. 524-542 - Rongqi Li, Zhiyi Tan, Qianyu Zhu:
Batch scheduling of nonidentical job sizes with minsum criteria. 543-564 - Yuanxiao Wu, Xiwen Lu:
Improved algorithms for single vehicle scheduling on tree/cycle networks. 565-580 - Liying Kang, Wei Zhang, Erfang Shan:
The spectral radius and domination number in linear uniform hypergraphs. 581-592 - Wen Xu, Caiwei Yuan, Keke Peng, Hongwei Du:
Big data driven urban railway planning: Shenzhen metro case study. 593-615 - Deshi Ye, Lin Chen, Guochuan Zhang:
On the price of anarchy of two-stage machine scheduling games. 616-635 - Xin Chen, Qingqin Nong, Qizhi Fang:
An improved mechanism for selfish bin packing. 636-656 - Gonçalo R. L. Cerqueira, Sérgio S. Aguiar, Marlos Marques:
Modified Greedy Heuristic for the one-dimensional cutting stock problem. 657-674
Volume 42, Number 4, November 2021
- Liwei Zhong, Guochun Tang:
Preface: Combinatorial optimization drives the future of Health Care. 675-676 - Xuanzhu Fan, Jiafu Tang, Chongjun Yan, Hainan Guo, Zhongfa Cao:
Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization. 677-699 - Cheng He, Changchun Liu, Tao Wu, Ying Xu, Yang Wu, Tong Chen:
Medical rolling bearing fault prognostics based on improved extreme learning machine. 700-721 - Ying Yang, Huijing Wu, Caixia Yan:
Medical consumable usage control based on Canopy_K-means clustering and WARM. 722-739 - Jing Yu, Lining Xing, Xu Tan:
The new treatment mode research of hepatitis B based on ant colony algorithm. 740-759 - Xuerui Gao, Yanqin Bai, Qian Li:
A sparse optimization problem with hybrid L2 -Lp regularization for application of magnetic resonance brain images. 760-784 - Zhiguo Wang, Lufei Huang, Cici Xiao He:
A multi-objective and multi-period optimization model for urban healthcare waste's reverse logistics network design. 785-812 - Hao Hao, Ji Zhang, Qian Zhang, Li Yao, Yichen Sun:
Improved gray neural network model for healthcare waste recycling forecasting. 813-830 - Qian Li, Wei Zhang:
An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction. 831-847 - Huidan Lin, Qun Li, Xueguo Xu, Ying Zhang:
Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example. 848-865 - Gengjun Gao, Yuxuan Che, Jian Shen:
Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode. 866-883 - He Huang, Wei Gao, Chun-ming Ye:
An intelligent data-driven model for disease diagnosis based on machine learning theory. 884-895 - Jing Fan, Hui Shi:
A three-stage supply chain scheduling problem based on the nursing assistants' daily work in a hospital. 896-908 - Shi Yin, Jian Chang, Hailan Pan, Haizhou Mao, Mei Wang:
Early warning of venous thromboembolism after surgery based on self-organizing competitive network. 909-927 - Feng Zhang, Liwei Zhong:
Three-sided matching problem with mixed preferences. 928-936 - Zhihong Zhao, Beibei Li, Jun Liu:
Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm. 937-947 - Xin Yan, Hongmiao Zhu, Jian Luo:
A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis. 948-965 - Gang Du, Xi Liang, Xiaoling Ouyang, Chunming Wang:
Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network. 966-987 - Bin Li, Qianghua Wei, Xinye Zhou:
Research on model and algorithm of TCM constitution identification based on artificial intelligence. 988-1003 - Ling Gai, Zhiyue Peng, Jiming Zhang, Jiafu Zhang:
Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming. 1004-1029 - Hongbo Li, Li Wang, Xuan Xia, Hongbo Liu:
Perceived service quality's effect on patient loyalty through patient attitude within the context of traditional Chinese medicine. 1030-1041 - Yi Du, Hua Yu, Zhijun Li:
Research of SVM ensembles in medical examination scheduling. 1042-1052 - Ruiping Wang, Mei Wang, Jian Chang, Zai Luo, Feng Zhang, Chen Huang:
An optimized approach of venous thrombus embolism risk assessment. 1053-1063
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.